./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_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:07:57,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:07:57,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:07:57,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:07:57,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:07:57,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:07:57,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:07:57,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:07:57,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:07:57,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:07:57,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:07:57,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:07:57,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:07:57,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:07:57,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:07:57,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:07:57,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:07:57,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:07:57,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:07:57,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:07:57,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:07:57,177 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:07:57,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:07:57,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:07:57,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:07:57,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:07:57,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:07:57,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:07:57,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:07:57,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:07:57,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:07:57,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:07:57,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:07:57,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:07:57,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:07:57,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:07:57,186 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:07:57,196 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:07:57,196 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:07:57,197 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:07:57,197 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:07:57,197 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:07:57,197 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:07:57,197 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:07:57,197 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:07:57,198 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:07:57,198 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:07:57,198 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:07:57,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:07:57,198 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:07:57,199 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:07:57,199 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:07:57,199 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:07:57,199 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:07:57,199 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:07:57,199 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:07:57,201 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:07:57,201 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:07:57,201 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:07:57,201 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:07:57,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:07:57,202 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:07:57,202 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:07:57,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:07:57,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:07:57,202 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:07:57,202 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:07:57,202 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:07:57,203 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:07:57,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:07:57,203 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:07:57,203 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_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:07:57,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:07:57,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:07:57,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:07:57,247 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:07:57,247 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:07:57,248 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-10-26 23:07:57,298 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data/1b5900994/8762bc7af5cb462b9a68ca7970f8391a/FLAG292f7598f [2018-10-26 23:07:57,737 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:07:57,738 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-10-26 23:07:57,758 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data/1b5900994/8762bc7af5cb462b9a68ca7970f8391a/FLAG292f7598f [2018-10-26 23:07:57,775 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data/1b5900994/8762bc7af5cb462b9a68ca7970f8391a [2018-10-26 23:07:57,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:07:57,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:07:57,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:07:57,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:07:57,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:07:57,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:07:57" (1/1) ... [2018-10-26 23:07:57,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3498a54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:57, skipping insertion in model container [2018-10-26 23:07:57,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:07:57" (1/1) ... [2018-10-26 23:07:57,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:07:57,843 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:07:58,349 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:07:58,358 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:07:58,599 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:07:58,773 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:07:58,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58 WrapperNode [2018-10-26 23:07:58,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:07:58,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:07:58,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:07:58,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:07:58,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:58,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:58,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:07:58,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:07:58,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:07:58,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:07:58,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:58,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:58,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:58,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:58,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:59,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:59,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... [2018-10-26 23:07:59,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:07:59,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:07:59,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:07:59,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:07:59,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:07:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:07:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:07:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-10-26 23:07:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-10-26 23:07:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:07:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:07:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:07:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:07:59,733 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:07:59,733 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:08:01,340 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:08:01,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:08:01 BoogieIcfgContainer [2018-10-26 23:08:01,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:08:01,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:08:01,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:08:01,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:08:01,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:07:57" (1/3) ... [2018-10-26 23:08:01,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63316f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:08:01, skipping insertion in model container [2018-10-26 23:08:01,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:07:58" (2/3) ... [2018-10-26 23:08:01,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63316f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:08:01, skipping insertion in model container [2018-10-26 23:08:01,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:08:01" (3/3) ... [2018-10-26 23:08:01,348 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-10-26 23:08:01,357 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:08:01,367 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:08:01,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:08:01,415 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:08:01,415 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:08:01,415 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:08:01,416 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:08:01,416 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:08:01,416 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:08:01,416 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:08:01,416 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:08:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-10-26 23:08:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 23:08:01,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:01,448 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-10-26 23:08:01,450 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:01,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:01,460 INFO L82 PathProgramCache]: Analyzing trace with hash -264402800, now seen corresponding path program 1 times [2018-10-26 23:08:01,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:01,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:01,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:01,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:01,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:01,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:01,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:01,974 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:01,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:01,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:01,995 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2018-10-26 23:08:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:02,998 INFO L93 Difference]: Finished difference Result 358 states and 605 transitions. [2018-10-26 23:08:02,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:03,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-26 23:08:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:03,010 INFO L225 Difference]: With dead ends: 358 [2018-10-26 23:08:03,010 INFO L226 Difference]: Without dead ends: 182 [2018-10-26 23:08:03,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-26 23:08:03,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2018-10-26 23:08:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-26 23:08:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 256 transitions. [2018-10-26 23:08:03,059 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 256 transitions. Word has length 51 [2018-10-26 23:08:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:03,060 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 256 transitions. [2018-10-26 23:08:03,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 256 transitions. [2018-10-26 23:08:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 23:08:03,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:03,062 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-10-26 23:08:03,063 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:03,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -311734117, now seen corresponding path program 1 times [2018-10-26 23:08:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:03,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:03,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:03,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:03,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:03,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:03,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:03,413 INFO L87 Difference]: Start difference. First operand 165 states and 256 transitions. Second operand 4 states. [2018-10-26 23:08:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:03,852 INFO L93 Difference]: Finished difference Result 378 states and 591 transitions. [2018-10-26 23:08:03,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:03,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-10-26 23:08:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:03,855 INFO L225 Difference]: With dead ends: 378 [2018-10-26 23:08:03,855 INFO L226 Difference]: Without dead ends: 239 [2018-10-26 23:08:03,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-26 23:08:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 198. [2018-10-26 23:08:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-26 23:08:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 315 transitions. [2018-10-26 23:08:03,870 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 315 transitions. Word has length 65 [2018-10-26 23:08:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:03,870 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 315 transitions. [2018-10-26 23:08:03,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 315 transitions. [2018-10-26 23:08:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 23:08:03,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:03,873 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-10-26 23:08:03,873 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:03,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1166381172, now seen corresponding path program 1 times [2018-10-26 23:08:03,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:03,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:03,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:03,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:03,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:04,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:04,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:04,107 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:04,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:04,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:04,109 INFO L87 Difference]: Start difference. First operand 198 states and 315 transitions. Second operand 4 states. [2018-10-26 23:08:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:04,856 INFO L93 Difference]: Finished difference Result 505 states and 807 transitions. [2018-10-26 23:08:04,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:04,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-10-26 23:08:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:04,861 INFO L225 Difference]: With dead ends: 505 [2018-10-26 23:08:04,861 INFO L226 Difference]: Without dead ends: 333 [2018-10-26 23:08:04,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-26 23:08:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 239. [2018-10-26 23:08:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-26 23:08:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 389 transitions. [2018-10-26 23:08:04,881 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 389 transitions. Word has length 66 [2018-10-26 23:08:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:04,882 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 389 transitions. [2018-10-26 23:08:04,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2018-10-26 23:08:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 23:08:04,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:04,886 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-10-26 23:08:04,886 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:04,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1467533643, now seen corresponding path program 1 times [2018-10-26 23:08:04,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:04,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:05,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:05,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:05,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:05,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:05,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:05,047 INFO L87 Difference]: Start difference. First operand 239 states and 389 transitions. Second operand 4 states. [2018-10-26 23:08:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:05,579 INFO L93 Difference]: Finished difference Result 586 states and 954 transitions. [2018-10-26 23:08:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:05,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-26 23:08:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:05,582 INFO L225 Difference]: With dead ends: 586 [2018-10-26 23:08:05,582 INFO L226 Difference]: Without dead ends: 373 [2018-10-26 23:08:05,584 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-10-26 23:08:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-26 23:08:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 280. [2018-10-26 23:08:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-26 23:08:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 464 transitions. [2018-10-26 23:08:05,600 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 464 transitions. Word has length 67 [2018-10-26 23:08:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:05,600 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 464 transitions. [2018-10-26 23:08:05,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 464 transitions. [2018-10-26 23:08:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 23:08:05,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:05,604 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-10-26 23:08:05,605 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:05,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash -868848703, now seen corresponding path program 1 times [2018-10-26 23:08:05,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:05,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:05,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:08:05,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:05,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:05,852 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:05,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:05,853 INFO L87 Difference]: Start difference. First operand 280 states and 464 transitions. Second operand 4 states. [2018-10-26 23:08:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:06,527 INFO L93 Difference]: Finished difference Result 551 states and 912 transitions. [2018-10-26 23:08:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:06,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-26 23:08:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:06,528 INFO L225 Difference]: With dead ends: 551 [2018-10-26 23:08:06,528 INFO L226 Difference]: Without dead ends: 297 [2018-10-26 23:08:06,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-26 23:08:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 280. [2018-10-26 23:08:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-26 23:08:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 463 transitions. [2018-10-26 23:08:06,538 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 463 transitions. Word has length 95 [2018-10-26 23:08:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:06,538 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 463 transitions. [2018-10-26 23:08:06,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 463 transitions. [2018-10-26 23:08:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 23:08:06,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:06,542 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-10-26 23:08:06,542 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:06,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2104109530, now seen corresponding path program 1 times [2018-10-26 23:08:06,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:06,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:06,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:06,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:06,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:06,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:06,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:06,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:06,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:06,674 INFO L87 Difference]: Start difference. First operand 280 states and 463 transitions. Second operand 4 states. [2018-10-26 23:08:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:07,023 INFO L93 Difference]: Finished difference Result 705 states and 1171 transitions. [2018-10-26 23:08:07,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:07,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-10-26 23:08:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:07,026 INFO L225 Difference]: With dead ends: 705 [2018-10-26 23:08:07,026 INFO L226 Difference]: Without dead ends: 451 [2018-10-26 23:08:07,027 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-10-26 23:08:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-26 23:08:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 346. [2018-10-26 23:08:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-26 23:08:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 581 transitions. [2018-10-26 23:08:07,035 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 581 transitions. Word has length 96 [2018-10-26 23:08:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:07,036 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 581 transitions. [2018-10-26 23:08:07,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 581 transitions. [2018-10-26 23:08:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 23:08:07,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:07,039 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-10-26 23:08:07,039 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:07,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash -510869019, now seen corresponding path program 1 times [2018-10-26 23:08:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:07,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:07,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:08:07,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:07,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:07,254 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:07,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:07,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:07,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:07,255 INFO L87 Difference]: Start difference. First operand 346 states and 581 transitions. Second operand 4 states. [2018-10-26 23:08:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:08,268 INFO L93 Difference]: Finished difference Result 681 states and 1145 transitions. [2018-10-26 23:08:08,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:08,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-10-26 23:08:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:08,270 INFO L225 Difference]: With dead ends: 681 [2018-10-26 23:08:08,270 INFO L226 Difference]: Without dead ends: 361 [2018-10-26 23:08:08,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-26 23:08:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 346. [2018-10-26 23:08:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-26 23:08:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 580 transitions. [2018-10-26 23:08:08,284 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 580 transitions. Word has length 96 [2018-10-26 23:08:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:08,285 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 580 transitions. [2018-10-26 23:08:08,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 580 transitions. [2018-10-26 23:08:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 23:08:08,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:08,287 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-10-26 23:08:08,287 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:08,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash 914363844, now seen corresponding path program 1 times [2018-10-26 23:08:08,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:08,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:08:08,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:08,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:08:08,429 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:08,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:08:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:08:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:08:08,430 INFO L87 Difference]: Start difference. First operand 346 states and 580 transitions. Second operand 3 states. [2018-10-26 23:08:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:08,848 INFO L93 Difference]: Finished difference Result 982 states and 1665 transitions. [2018-10-26 23:08:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:08:08,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 23:08:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:08,851 INFO L225 Difference]: With dead ends: 982 [2018-10-26 23:08:08,851 INFO L226 Difference]: Without dead ends: 662 [2018-10-26 23:08:08,852 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-10-26 23:08:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-26 23:08:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2018-10-26 23:08:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-26 23:08:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1098 transitions. [2018-10-26 23:08:08,873 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1098 transitions. Word has length 102 [2018-10-26 23:08:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:08,874 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 1098 transitions. [2018-10-26 23:08:08,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:08:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1098 transitions. [2018-10-26 23:08:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 23:08:08,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:08,879 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-10-26 23:08:08,879 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:08,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 16970566, now seen corresponding path program 1 times [2018-10-26 23:08:08,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:08,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:08,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:08,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:09,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:09,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:09,044 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:09,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:09,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:09,045 INFO L87 Difference]: Start difference. First operand 660 states and 1098 transitions. Second operand 4 states. [2018-10-26 23:08:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:10,199 INFO L93 Difference]: Finished difference Result 1557 states and 2555 transitions. [2018-10-26 23:08:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:10,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-26 23:08:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:10,201 INFO L225 Difference]: With dead ends: 1557 [2018-10-26 23:08:10,201 INFO L226 Difference]: Without dead ends: 923 [2018-10-26 23:08:10,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-10-26 23:08:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 736. [2018-10-26 23:08:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-10-26 23:08:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1232 transitions. [2018-10-26 23:08:10,220 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1232 transitions. Word has length 102 [2018-10-26 23:08:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:10,220 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 1232 transitions. [2018-10-26 23:08:10,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1232 transitions. [2018-10-26 23:08:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 23:08:10,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:10,222 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-10-26 23:08:10,222 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:10,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1063326823, now seen corresponding path program 1 times [2018-10-26 23:08:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:10,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:10,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:10,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:10,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:10,430 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:10,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:10,431 INFO L87 Difference]: Start difference. First operand 736 states and 1232 transitions. Second operand 4 states. [2018-10-26 23:08:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:10,905 INFO L93 Difference]: Finished difference Result 1627 states and 2677 transitions. [2018-10-26 23:08:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:10,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-10-26 23:08:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:10,908 INFO L225 Difference]: With dead ends: 1627 [2018-10-26 23:08:10,909 INFO L226 Difference]: Without dead ends: 917 [2018-10-26 23:08:10,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-10-26 23:08:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 736. [2018-10-26 23:08:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-10-26 23:08:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1228 transitions. [2018-10-26 23:08:10,930 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1228 transitions. Word has length 103 [2018-10-26 23:08:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:10,930 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 1228 transitions. [2018-10-26 23:08:10,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1228 transitions. [2018-10-26 23:08:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 23:08:10,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:10,933 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-10-26 23:08:10,933 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:10,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1912417701, now seen corresponding path program 1 times [2018-10-26 23:08:10,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:10,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:10,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:10,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:10,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 23:08:11,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:11,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:11,132 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:11,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:11,133 INFO L87 Difference]: Start difference. First operand 736 states and 1228 transitions. Second operand 4 states. [2018-10-26 23:08:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:12,120 INFO L93 Difference]: Finished difference Result 1460 states and 2438 transitions. [2018-10-26 23:08:12,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:12,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-26 23:08:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:12,123 INFO L225 Difference]: With dead ends: 1460 [2018-10-26 23:08:12,123 INFO L226 Difference]: Without dead ends: 750 [2018-10-26 23:08:12,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-10-26 23:08:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 736. [2018-10-26 23:08:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-10-26 23:08:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1227 transitions. [2018-10-26 23:08:12,142 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1227 transitions. Word has length 110 [2018-10-26 23:08:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:12,142 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 1227 transitions. [2018-10-26 23:08:12,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1227 transitions. [2018-10-26 23:08:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 23:08:12,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:12,145 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-10-26 23:08:12,145 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:12,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:12,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1917704391, now seen corresponding path program 1 times [2018-10-26 23:08:12,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:12,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:12,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 23:08:12,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:12,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:08:12,323 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:12,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:08:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:08:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:12,328 INFO L87 Difference]: Start difference. First operand 736 states and 1227 transitions. Second operand 5 states. [2018-10-26 23:08:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:12,717 INFO L93 Difference]: Finished difference Result 1466 states and 2446 transitions. [2018-10-26 23:08:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:08:12,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-10-26 23:08:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:12,720 INFO L225 Difference]: With dead ends: 1466 [2018-10-26 23:08:12,720 INFO L226 Difference]: Without dead ends: 756 [2018-10-26 23:08:12,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:08:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-10-26 23:08:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 754. [2018-10-26 23:08:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-10-26 23:08:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1237 transitions. [2018-10-26 23:08:12,739 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1237 transitions. Word has length 110 [2018-10-26 23:08:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:12,739 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 1237 transitions. [2018-10-26 23:08:12,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:08:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1237 transitions. [2018-10-26 23:08:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 23:08:12,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:12,743 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-10-26 23:08:12,743 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:12,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1452118287, now seen corresponding path program 1 times [2018-10-26 23:08:12,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:12,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:08:12,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:12,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:12,916 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:12,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:12,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:12,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:12,917 INFO L87 Difference]: Start difference. First operand 754 states and 1237 transitions. Second operand 4 states. [2018-10-26 23:08:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:13,989 INFO L93 Difference]: Finished difference Result 1743 states and 2824 transitions. [2018-10-26 23:08:13,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:13,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-26 23:08:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:13,992 INFO L225 Difference]: With dead ends: 1743 [2018-10-26 23:08:13,992 INFO L226 Difference]: Without dead ends: 1015 [2018-10-26 23:08:13,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-10-26 23:08:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 788. [2018-10-26 23:08:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-10-26 23:08:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1279 transitions. [2018-10-26 23:08:14,014 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1279 transitions. Word has length 110 [2018-10-26 23:08:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:14,014 INFO L481 AbstractCegarLoop]: Abstraction has 788 states and 1279 transitions. [2018-10-26 23:08:14,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1279 transitions. [2018-10-26 23:08:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 23:08:14,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:14,018 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-10-26 23:08:14,018 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:14,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1412356939, now seen corresponding path program 1 times [2018-10-26 23:08:14,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:14,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:14,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:14,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:14,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:08:14,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:14,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:14,195 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:14,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:14,197 INFO L87 Difference]: Start difference. First operand 788 states and 1279 transitions. Second operand 4 states. [2018-10-26 23:08:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:14,594 INFO L93 Difference]: Finished difference Result 1729 states and 2768 transitions. [2018-10-26 23:08:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:14,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-10-26 23:08:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:14,596 INFO L225 Difference]: With dead ends: 1729 [2018-10-26 23:08:14,596 INFO L226 Difference]: Without dead ends: 967 [2018-10-26 23:08:14,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-26 23:08:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 788. [2018-10-26 23:08:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-10-26 23:08:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1267 transitions. [2018-10-26 23:08:14,618 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1267 transitions. Word has length 111 [2018-10-26 23:08:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:14,618 INFO L481 AbstractCegarLoop]: Abstraction has 788 states and 1267 transitions. [2018-10-26 23:08:14,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1267 transitions. [2018-10-26 23:08:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-26 23:08:14,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:14,622 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-10-26 23:08:14,622 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:14,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1530199105, now seen corresponding path program 1 times [2018-10-26 23:08:14,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:14,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:14,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:14,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:14,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:14,820 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:14,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:14,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:14,821 INFO L87 Difference]: Start difference. First operand 788 states and 1267 transitions. Second operand 4 states. [2018-10-26 23:08:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:15,211 INFO L93 Difference]: Finished difference Result 1811 states and 2880 transitions. [2018-10-26 23:08:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:15,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-10-26 23:08:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:15,213 INFO L225 Difference]: With dead ends: 1811 [2018-10-26 23:08:15,213 INFO L226 Difference]: Without dead ends: 1049 [2018-10-26 23:08:15,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-10-26 23:08:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 876. [2018-10-26 23:08:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-10-26 23:08:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1413 transitions. [2018-10-26 23:08:15,238 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1413 transitions. Word has length 113 [2018-10-26 23:08:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:15,238 INFO L481 AbstractCegarLoop]: Abstraction has 876 states and 1413 transitions. [2018-10-26 23:08:15,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1413 transitions. [2018-10-26 23:08:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-26 23:08:15,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:15,242 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-10-26 23:08:15,242 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:15,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1652681162, now seen corresponding path program 1 times [2018-10-26 23:08:15,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:15,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:15,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:15,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:08:15,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:15,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:15,433 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:15,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:15,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:15,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:15,434 INFO L87 Difference]: Start difference. First operand 876 states and 1413 transitions. Second operand 4 states. [2018-10-26 23:08:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:16,252 INFO L93 Difference]: Finished difference Result 1905 states and 3036 transitions. [2018-10-26 23:08:16,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:16,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-10-26 23:08:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:16,254 INFO L225 Difference]: With dead ends: 1905 [2018-10-26 23:08:16,254 INFO L226 Difference]: Without dead ends: 1051 [2018-10-26 23:08:16,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-10-26 23:08:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 880. [2018-10-26 23:08:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-10-26 23:08:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1419 transitions. [2018-10-26 23:08:16,280 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1419 transitions. Word has length 114 [2018-10-26 23:08:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:16,280 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1419 transitions. [2018-10-26 23:08:16,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1419 transitions. [2018-10-26 23:08:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:08:16,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:16,283 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-10-26 23:08:16,283 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:16,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:16,283 INFO L82 PathProgramCache]: Analyzing trace with hash -945836914, now seen corresponding path program 1 times [2018-10-26 23:08:16,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:16,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:16,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:16,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:16,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:08:16,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:16,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:16,411 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:16,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:16,412 INFO L87 Difference]: Start difference. First operand 880 states and 1419 transitions. Second operand 4 states. [2018-10-26 23:08:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:17,067 INFO L93 Difference]: Finished difference Result 1991 states and 3176 transitions. [2018-10-26 23:08:17,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:17,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-10-26 23:08:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:17,071 INFO L225 Difference]: With dead ends: 1991 [2018-10-26 23:08:17,071 INFO L226 Difference]: Without dead ends: 1137 [2018-10-26 23:08:17,072 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-10-26 23:08:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2018-10-26 23:08:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 942. [2018-10-26 23:08:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-10-26 23:08:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1511 transitions. [2018-10-26 23:08:17,102 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1511 transitions. Word has length 124 [2018-10-26 23:08:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:17,103 INFO L481 AbstractCegarLoop]: Abstraction has 942 states and 1511 transitions. [2018-10-26 23:08:17,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1511 transitions. [2018-10-26 23:08:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:08:17,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:17,108 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-10-26 23:08:17,108 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:17,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:17,109 INFO L82 PathProgramCache]: Analyzing trace with hash 485272306, now seen corresponding path program 1 times [2018-10-26 23:08:17,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:17,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:17,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:08:17,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:17,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:17,249 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:17,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:17,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:17,249 INFO L87 Difference]: Start difference. First operand 942 states and 1511 transitions. Second operand 4 states. [2018-10-26 23:08:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:17,566 INFO L93 Difference]: Finished difference Result 2029 states and 3218 transitions. [2018-10-26 23:08:17,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:17,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-10-26 23:08:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:17,569 INFO L225 Difference]: With dead ends: 2029 [2018-10-26 23:08:17,569 INFO L226 Difference]: Without dead ends: 1113 [2018-10-26 23:08:17,570 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-10-26 23:08:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-10-26 23:08:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 942. [2018-10-26 23:08:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-10-26 23:08:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1497 transitions. [2018-10-26 23:08:17,600 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1497 transitions. Word has length 125 [2018-10-26 23:08:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:17,601 INFO L481 AbstractCegarLoop]: Abstraction has 942 states and 1497 transitions. [2018-10-26 23:08:17,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1497 transitions. [2018-10-26 23:08:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:08:17,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:17,606 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-10-26 23:08:17,606 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:17,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:17,607 INFO L82 PathProgramCache]: Analyzing trace with hash -24059285, now seen corresponding path program 1 times [2018-10-26 23:08:17,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:17,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:17,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:17,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:17,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:08:17,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:17,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:17,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:17,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:17,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:17,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:17,802 INFO L87 Difference]: Start difference. First operand 942 states and 1497 transitions. Second operand 4 states. [2018-10-26 23:08:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:18,113 INFO L93 Difference]: Finished difference Result 2115 states and 3328 transitions. [2018-10-26 23:08:18,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:18,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-10-26 23:08:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:18,116 INFO L225 Difference]: With dead ends: 2115 [2018-10-26 23:08:18,116 INFO L226 Difference]: Without dead ends: 1199 [2018-10-26 23:08:18,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2018-10-26 23:08:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1000. [2018-10-26 23:08:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-10-26 23:08:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1579 transitions. [2018-10-26 23:08:18,149 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1579 transitions. Word has length 128 [2018-10-26 23:08:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:18,150 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1579 transitions. [2018-10-26 23:08:18,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1579 transitions. [2018-10-26 23:08:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:08:18,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:18,155 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-10-26 23:08:18,155 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:18,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 769461103, now seen corresponding path program 1 times [2018-10-26 23:08:18,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:18,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:18,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:18,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:08:18,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:18,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:18,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:18,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:18,281 INFO L87 Difference]: Start difference. First operand 1000 states and 1579 transitions. Second operand 4 states. [2018-10-26 23:08:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:18,678 INFO L93 Difference]: Finished difference Result 2145 states and 3354 transitions. [2018-10-26 23:08:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:18,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-10-26 23:08:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:18,681 INFO L225 Difference]: With dead ends: 2145 [2018-10-26 23:08:18,681 INFO L226 Difference]: Without dead ends: 1171 [2018-10-26 23:08:18,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-10-26 23:08:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1000. [2018-10-26 23:08:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-10-26 23:08:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1563 transitions. [2018-10-26 23:08:18,711 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1563 transitions. Word has length 129 [2018-10-26 23:08:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:18,711 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1563 transitions. [2018-10-26 23:08:18,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1563 transitions. [2018-10-26 23:08:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 23:08:18,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:18,716 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-10-26 23:08:18,716 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:18,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1344555660, now seen corresponding path program 1 times [2018-10-26 23:08:18,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:18,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:18,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:08:18,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:18,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:18,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:18,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:18,923 INFO L87 Difference]: Start difference. First operand 1000 states and 1563 transitions. Second operand 4 states. [2018-10-26 23:08:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:19,545 INFO L93 Difference]: Finished difference Result 2231 states and 3456 transitions. [2018-10-26 23:08:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:19,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-10-26 23:08:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:19,549 INFO L225 Difference]: With dead ends: 2231 [2018-10-26 23:08:19,549 INFO L226 Difference]: Without dead ends: 1257 [2018-10-26 23:08:19,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-10-26 23:08:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1072. [2018-10-26 23:08:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-10-26 23:08:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1671 transitions. [2018-10-26 23:08:19,573 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1671 transitions. Word has length 136 [2018-10-26 23:08:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:19,574 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1671 transitions. [2018-10-26 23:08:19,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1671 transitions. [2018-10-26 23:08:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 23:08:19,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:19,576 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-10-26 23:08:19,576 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:19,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash -806432843, now seen corresponding path program 1 times [2018-10-26 23:08:19,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:19,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:19,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:19,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:08:19,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:19,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:19,783 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:19,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:19,785 INFO L87 Difference]: Start difference. First operand 1072 states and 1671 transitions. Second operand 4 states. [2018-10-26 23:08:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:20,316 INFO L93 Difference]: Finished difference Result 2289 states and 3538 transitions. [2018-10-26 23:08:20,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:20,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-10-26 23:08:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:20,320 INFO L225 Difference]: With dead ends: 2289 [2018-10-26 23:08:20,321 INFO L226 Difference]: Without dead ends: 1243 [2018-10-26 23:08:20,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2018-10-26 23:08:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1072. [2018-10-26 23:08:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-10-26 23:08:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1663 transitions. [2018-10-26 23:08:20,346 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1663 transitions. Word has length 137 [2018-10-26 23:08:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:20,346 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1663 transitions. [2018-10-26 23:08:20,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1663 transitions. [2018-10-26 23:08:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-26 23:08:20,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:20,348 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-10-26 23:08:20,348 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:20,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:20,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1732337042, now seen corresponding path program 1 times [2018-10-26 23:08:20,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:20,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:20,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:20,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:20,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:08:20,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:20,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:20,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:20,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:20,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:20,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:20,505 INFO L87 Difference]: Start difference. First operand 1072 states and 1663 transitions. Second operand 4 states. [2018-10-26 23:08:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:20,707 INFO L93 Difference]: Finished difference Result 1639 states and 2551 transitions. [2018-10-26 23:08:20,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:20,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-10-26 23:08:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:20,709 INFO L225 Difference]: With dead ends: 1639 [2018-10-26 23:08:20,710 INFO L226 Difference]: Without dead ends: 1113 [2018-10-26 23:08:20,710 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-10-26 23:08:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-10-26 23:08:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1095. [2018-10-26 23:08:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-10-26 23:08:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1699 transitions. [2018-10-26 23:08:20,733 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1699 transitions. Word has length 155 [2018-10-26 23:08:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:20,733 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1699 transitions. [2018-10-26 23:08:20,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1699 transitions. [2018-10-26 23:08:20,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-26 23:08:20,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:20,735 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-10-26 23:08:20,735 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:20,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:20,735 INFO L82 PathProgramCache]: Analyzing trace with hash -118179921, now seen corresponding path program 1 times [2018-10-26 23:08:20,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:20,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:20,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 23:08:20,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:20,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:20,930 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:20,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:20,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:20,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:20,931 INFO L87 Difference]: Start difference. First operand 1095 states and 1699 transitions. Second operand 4 states. [2018-10-26 23:08:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:21,469 INFO L93 Difference]: Finished difference Result 2421 states and 3724 transitions. [2018-10-26 23:08:21,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:21,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-10-26 23:08:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:21,473 INFO L225 Difference]: With dead ends: 2421 [2018-10-26 23:08:21,473 INFO L226 Difference]: Without dead ends: 1352 [2018-10-26 23:08:21,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-10-26 23:08:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1149. [2018-10-26 23:08:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2018-10-26 23:08:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1769 transitions. [2018-10-26 23:08:21,497 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1769 transitions. Word has length 157 [2018-10-26 23:08:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:21,498 INFO L481 AbstractCegarLoop]: Abstraction has 1149 states and 1769 transitions. [2018-10-26 23:08:21,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1769 transitions. [2018-10-26 23:08:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-26 23:08:21,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:21,500 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-10-26 23:08:21,500 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:21,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash 531844235, now seen corresponding path program 1 times [2018-10-26 23:08:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:21,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 23:08:21,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:21,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:21,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:21,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:21,637 INFO L87 Difference]: Start difference. First operand 1149 states and 1769 transitions. Second operand 4 states. [2018-10-26 23:08:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:21,907 INFO L93 Difference]: Finished difference Result 2443 states and 3734 transitions. [2018-10-26 23:08:21,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:21,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-10-26 23:08:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:21,910 INFO L225 Difference]: With dead ends: 2443 [2018-10-26 23:08:21,910 INFO L226 Difference]: Without dead ends: 1320 [2018-10-26 23:08:21,911 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-10-26 23:08:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2018-10-26 23:08:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1149. [2018-10-26 23:08:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2018-10-26 23:08:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1749 transitions. [2018-10-26 23:08:21,941 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1749 transitions. Word has length 158 [2018-10-26 23:08:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:21,941 INFO L481 AbstractCegarLoop]: Abstraction has 1149 states and 1749 transitions. [2018-10-26 23:08:21,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1749 transitions. [2018-10-26 23:08:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-26 23:08:21,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:21,943 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-10-26 23:08:21,943 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:21,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash 937831995, now seen corresponding path program 1 times [2018-10-26 23:08:21,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:21,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:21,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:21,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 23:08:22,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:22,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:22,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:22,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:22,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:22,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:22,146 INFO L87 Difference]: Start difference. First operand 1149 states and 1749 transitions. Second operand 4 states. [2018-10-26 23:08:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:22,447 INFO L93 Difference]: Finished difference Result 2532 states and 3823 transitions. [2018-10-26 23:08:22,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:22,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-10-26 23:08:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:22,451 INFO L225 Difference]: With dead ends: 2532 [2018-10-26 23:08:22,451 INFO L226 Difference]: Without dead ends: 1409 [2018-10-26 23:08:22,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2018-10-26 23:08:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1236. [2018-10-26 23:08:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2018-10-26 23:08:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1872 transitions. [2018-10-26 23:08:22,494 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1872 transitions. Word has length 158 [2018-10-26 23:08:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:22,495 INFO L481 AbstractCegarLoop]: Abstraction has 1236 states and 1872 transitions. [2018-10-26 23:08:22,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1872 transitions. [2018-10-26 23:08:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 23:08:22,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:22,499 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-10-26 23:08:22,499 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:22,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1196226428, now seen corresponding path program 1 times [2018-10-26 23:08:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:22,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:22,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 23:08:22,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:22,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:22,748 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:22,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:22,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:22,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:22,749 INFO L87 Difference]: Start difference. First operand 1236 states and 1872 transitions. Second operand 4 states. [2018-10-26 23:08:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:23,275 INFO L93 Difference]: Finished difference Result 2617 states and 3940 transitions. [2018-10-26 23:08:23,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:23,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-10-26 23:08:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:23,280 INFO L225 Difference]: With dead ends: 2617 [2018-10-26 23:08:23,280 INFO L226 Difference]: Without dead ends: 1391 [2018-10-26 23:08:23,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-26 23:08:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1220. [2018-10-26 23:08:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-10-26 23:08:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1844 transitions. [2018-10-26 23:08:23,314 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1844 transitions. Word has length 159 [2018-10-26 23:08:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:23,314 INFO L481 AbstractCegarLoop]: Abstraction has 1220 states and 1844 transitions. [2018-10-26 23:08:23,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1844 transitions. [2018-10-26 23:08:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-26 23:08:23,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:23,316 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-10-26 23:08:23,316 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:23,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1020155880, now seen corresponding path program 1 times [2018-10-26 23:08:23,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:23,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:23,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:23,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:23,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 23:08:23,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:23,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:23,516 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:23,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:23,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:23,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:23,517 INFO L87 Difference]: Start difference. First operand 1220 states and 1844 transitions. Second operand 4 states. [2018-10-26 23:08:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:24,058 INFO L93 Difference]: Finished difference Result 2655 states and 3992 transitions. [2018-10-26 23:08:24,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:24,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-10-26 23:08:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:24,061 INFO L225 Difference]: With dead ends: 2655 [2018-10-26 23:08:24,061 INFO L226 Difference]: Without dead ends: 1461 [2018-10-26 23:08:24,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2018-10-26 23:08:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1288. [2018-10-26 23:08:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-10-26 23:08:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1938 transitions. [2018-10-26 23:08:24,092 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1938 transitions. Word has length 171 [2018-10-26 23:08:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:24,093 INFO L481 AbstractCegarLoop]: Abstraction has 1288 states and 1938 transitions. [2018-10-26 23:08:24,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1938 transitions. [2018-10-26 23:08:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 23:08:24,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:24,095 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-10-26 23:08:24,095 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:24,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2124923201, now seen corresponding path program 1 times [2018-10-26 23:08:24,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:24,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:24,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:24,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:24,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 23:08:24,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:24,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:24,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:24,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:24,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:24,209 INFO L87 Difference]: Start difference. First operand 1288 states and 1938 transitions. Second operand 4 states. [2018-10-26 23:08:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:24,685 INFO L93 Difference]: Finished difference Result 2721 states and 4072 transitions. [2018-10-26 23:08:24,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:24,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-10-26 23:08:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:24,689 INFO L225 Difference]: With dead ends: 2721 [2018-10-26 23:08:24,689 INFO L226 Difference]: Without dead ends: 1441 [2018-10-26 23:08:24,691 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-10-26 23:08:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-10-26 23:08:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1204. [2018-10-26 23:08:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-10-26 23:08:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1798 transitions. [2018-10-26 23:08:24,720 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1798 transitions. Word has length 172 [2018-10-26 23:08:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:24,720 INFO L481 AbstractCegarLoop]: Abstraction has 1204 states and 1798 transitions. [2018-10-26 23:08:24,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1798 transitions. [2018-10-26 23:08:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 23:08:24,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:24,722 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-10-26 23:08:24,722 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:24,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:24,723 INFO L82 PathProgramCache]: Analyzing trace with hash 320424237, now seen corresponding path program 1 times [2018-10-26 23:08:24,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:24,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:24,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:24,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:24,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 23:08:24,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:24,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:08:24,838 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:24,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:08:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:08:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:08:24,839 INFO L87 Difference]: Start difference. First operand 1204 states and 1798 transitions. Second operand 3 states. [2018-10-26 23:08:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:25,070 INFO L93 Difference]: Finished difference Result 2408 states and 3621 transitions. [2018-10-26 23:08:25,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:08:25,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-10-26 23:08:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:25,074 INFO L225 Difference]: With dead ends: 2408 [2018-10-26 23:08:25,074 INFO L226 Difference]: Without dead ends: 1804 [2018-10-26 23:08:25,075 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-10-26 23:08:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2018-10-26 23:08:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1783. [2018-10-26 23:08:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2018-10-26 23:08:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2669 transitions. [2018-10-26 23:08:25,127 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2669 transitions. Word has length 178 [2018-10-26 23:08:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:25,127 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 2669 transitions. [2018-10-26 23:08:25,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:08:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2669 transitions. [2018-10-26 23:08:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 23:08:25,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:25,130 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-10-26 23:08:25,130 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:25,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash 296110402, now seen corresponding path program 1 times [2018-10-26 23:08:25,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:25,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:25,131 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 23:08:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:25,287 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:25,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:25,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:25,288 INFO L87 Difference]: Start difference. First operand 1783 states and 2669 transitions. Second operand 4 states. [2018-10-26 23:08:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:25,626 INFO L93 Difference]: Finished difference Result 3868 states and 5761 transitions. [2018-10-26 23:08:25,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:25,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-26 23:08:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:25,630 INFO L225 Difference]: With dead ends: 3868 [2018-10-26 23:08:25,630 INFO L226 Difference]: Without dead ends: 2111 [2018-10-26 23:08:25,632 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-10-26 23:08:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2018-10-26 23:08:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1858. [2018-10-26 23:08:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-10-26 23:08:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2756 transitions. [2018-10-26 23:08:25,702 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2756 transitions. Word has length 180 [2018-10-26 23:08:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:25,703 INFO L481 AbstractCegarLoop]: Abstraction has 1858 states and 2756 transitions. [2018-10-26 23:08:25,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2756 transitions. [2018-10-26 23:08:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 23:08:25,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:25,705 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-10-26 23:08:25,705 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:25,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1181693764, now seen corresponding path program 1 times [2018-10-26 23:08:25,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:25,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:25,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:25,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:25,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 23:08:25,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:25,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:25,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:25,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:25,883 INFO L87 Difference]: Start difference. First operand 1858 states and 2756 transitions. Second operand 4 states. [2018-10-26 23:08:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:26,207 INFO L93 Difference]: Finished difference Result 3940 states and 5809 transitions. [2018-10-26 23:08:26,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:26,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-10-26 23:08:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:26,210 INFO L225 Difference]: With dead ends: 3940 [2018-10-26 23:08:26,210 INFO L226 Difference]: Without dead ends: 2108 [2018-10-26 23:08:26,213 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-10-26 23:08:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2018-10-26 23:08:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1858. [2018-10-26 23:08:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-10-26 23:08:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2717 transitions. [2018-10-26 23:08:26,285 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2717 transitions. Word has length 181 [2018-10-26 23:08:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:26,285 INFO L481 AbstractCegarLoop]: Abstraction has 1858 states and 2717 transitions. [2018-10-26 23:08:26,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2717 transitions. [2018-10-26 23:08:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 23:08:26,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:26,290 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-10-26 23:08:26,290 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:26,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:26,290 INFO L82 PathProgramCache]: Analyzing trace with hash -844719738, now seen corresponding path program 1 times [2018-10-26 23:08:26,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:26,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:26,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:26,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:26,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 23:08:26,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:26,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:26,485 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:26,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:26,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:26,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:26,486 INFO L87 Difference]: Start difference. First operand 1858 states and 2717 transitions. Second operand 4 states. [2018-10-26 23:08:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:26,996 INFO L93 Difference]: Finished difference Result 3940 states and 5731 transitions. [2018-10-26 23:08:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:26,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-10-26 23:08:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:27,001 INFO L225 Difference]: With dead ends: 3940 [2018-10-26 23:08:27,001 INFO L226 Difference]: Without dead ends: 2102 [2018-10-26 23:08:27,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2018-10-26 23:08:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1850. [2018-10-26 23:08:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2018-10-26 23:08:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2670 transitions. [2018-10-26 23:08:27,082 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2670 transitions. Word has length 181 [2018-10-26 23:08:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:27,083 INFO L481 AbstractCegarLoop]: Abstraction has 1850 states and 2670 transitions. [2018-10-26 23:08:27,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2670 transitions. [2018-10-26 23:08:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 23:08:27,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:27,088 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-10-26 23:08:27,088 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:27,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash 830414936, now seen corresponding path program 1 times [2018-10-26 23:08:27,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:27,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:27,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:27,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:27,089 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 23:08:27,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:08:27,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:08:27,295 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:08:27,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:08:27,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:08:27,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:08:27,298 INFO L87 Difference]: Start difference. First operand 1850 states and 2670 transitions. Second operand 4 states. [2018-10-26 23:08:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:08:27,652 INFO L93 Difference]: Finished difference Result 3307 states and 4762 transitions. [2018-10-26 23:08:27,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:08:27,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-10-26 23:08:27,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:08:27,655 INFO L225 Difference]: With dead ends: 3307 [2018-10-26 23:08:27,655 INFO L226 Difference]: Without dead ends: 1477 [2018-10-26 23:08:27,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:08:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-10-26 23:08:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1305. [2018-10-26 23:08:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-10-26 23:08:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1859 transitions. [2018-10-26 23:08:27,712 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1859 transitions. Word has length 182 [2018-10-26 23:08:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:08:27,713 INFO L481 AbstractCegarLoop]: Abstraction has 1305 states and 1859 transitions. [2018-10-26 23:08:27,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:08:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1859 transitions. [2018-10-26 23:08:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 23:08:27,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:08:27,714 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-10-26 23:08:27,714 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:08:27,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:08:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash 72233480, now seen corresponding path program 1 times [2018-10-26 23:08:27,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:08:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:27,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:08:27,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:08:27,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:08:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:08:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 153 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:08:28,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:08:28,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:08:28,135 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-10-26 23:08:28,136 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-10-26 23:08:28,192 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:08:28,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:08:28,976 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:09:07,228 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:09:07,229 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-10-26 23:09:07,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:09:07,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:09:07,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:09:07,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:09:07,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:09:07,256 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:09:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:09:07,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:09:07,793 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-26 23:09:07,829 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-10-26 23:09:07,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,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, 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-10-26 23:09:08,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:09:08,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,022 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,036 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-10-26 23:09:08,047 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-10-26 23:09:08,076 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:09:08,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 23:09:08,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:09:08,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:09:08,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:09:08,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10-26 23:09:08,102 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,110 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,126 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,142 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-10-26 23:09:08,142 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-10-26 23:09:08,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:09:08,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:09:08,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,451 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-10-26 23:09:08,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:09:08,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-10-26 23:09:08,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:09:08,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:09:08,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-10-26 23:09:08,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:09:08,611 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-10-26 23:09:08,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:09:08,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:09:08,635 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-10-26 23:09:08,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:09:08,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-10-26 23:09:08,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:09:08,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:09:08,671 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-10-26 23:09:08,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-10-26 23:09:08,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:09:08,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:09:08,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:08,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 23:09:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:09:08,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:09:09,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-10-26 23:09:09,441 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-10-26 23:09:09,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:09:09,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:09,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:09:09,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:09:09,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:09:09,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:09,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:09,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:09:09,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 23:09:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:09:09,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:09:09,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-10-26 23:09:09,924 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:09:09,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 23:09:09,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 23:09:09,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-10-26 23:09:09,925 INFO L87 Difference]: Start difference. First operand 1305 states and 1859 transitions. Second operand 16 states. [2018-10-26 23:09:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:09:12,588 INFO L93 Difference]: Finished difference Result 2581 states and 3675 transitions. [2018-10-26 23:09:12,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:09:12,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2018-10-26 23:09:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:09:12,592 INFO L225 Difference]: With dead ends: 2581 [2018-10-26 23:09:12,592 INFO L226 Difference]: Without dead ends: 1337 [2018-10-26 23:09:12,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 358 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2018-10-26 23:09:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2018-10-26 23:09:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1169. [2018-10-26 23:09:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-10-26 23:09:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1667 transitions. [2018-10-26 23:09:12,666 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1667 transitions. Word has length 184 [2018-10-26 23:09:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:09:12,666 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1667 transitions. [2018-10-26 23:09:12,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 23:09:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1667 transitions. [2018-10-26 23:09:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-26 23:09:12,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:09:12,672 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-10-26 23:09:12,672 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:09:12,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:09:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 857697873, now seen corresponding path program 1 times [2018-10-26 23:09:12,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:09:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:09:12,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:09:12,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:09:12,674 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:09:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:09:13,588 WARN L179 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-10-26 23:09:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:09:14,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:09:14,509 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:09:14,509 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-10-26 23:09:14,509 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-10-26 23:09:14,520 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:09:14,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:09:15,016 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:10:11,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:10:11,898 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-10-26 23:10:11,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:11,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:10:11,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:10:11,912 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:11,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:11,919 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:10:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:12,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:12,185 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-10-26 23:10:12,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,193 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-10-26 23:10:12,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, 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-10-26 23:10:12,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:12,200 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-10-26 23:10:12,203 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:12,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:12,212 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-10-26 23:10:12,212 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,248 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,260 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-10-26 23:10:12,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:35, output treesize:10 [2018-10-26 23:10:12,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-10-26 23:10:12,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:10:12,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,390 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-10-26 23:10:12,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:10:12,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,402 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-10-26 23:10:12,412 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-10-26 23:10:12,413 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,426 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,504 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:74 [2018-10-26 23:10:12,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:12,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:10:12,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:10:12,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:10:12,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-10-26 23:10:12,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:10:12,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,556 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-10-26 23:10:12,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 21 treesize of output 9 [2018-10-26 23:10:12,559 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,562 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,565 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:63, output treesize:20 [2018-10-26 23:10:12,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:12,584 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-10-26 23:10:12,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2018-10-26 23:10:12,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:12,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:10:12,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:10:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:10:12,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:10:12,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:12,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 107 [2018-10-26 23:10:12,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:10:12,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:10:12,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:10:12,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:10:12,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,820 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:12,822 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-10-26 23:10:12,843 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:10:12,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 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 42 [2018-10-26 23:10:12,850 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 23:10:12,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:12,866 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:10:12,867 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:10:12,867 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-10-26 23:10:12,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,870 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:12,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:10:12,874 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,876 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,881 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:12,890 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:125, output treesize:10 [2018-10-26 23:10:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:10:13,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:10:13,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 18 [2018-10-26 23:10:13,009 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:10:13,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 23:10:13,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 23:10:13,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-10-26 23:10:13,010 INFO L87 Difference]: Start difference. First operand 1169 states and 1667 transitions. Second operand 17 states. [2018-10-26 23:10:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:16,015 INFO L93 Difference]: Finished difference Result 6400 states and 9168 transitions. [2018-10-26 23:10:16,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 23:10:16,016 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2018-10-26 23:10:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:16,026 INFO L225 Difference]: With dead ends: 6400 [2018-10-26 23:10:16,026 INFO L226 Difference]: Without dead ends: 5292 [2018-10-26 23:10:16,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-10-26 23:10:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2018-10-26 23:10:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 2248. [2018-10-26 23:10:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-10-26 23:10:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3275 transitions. [2018-10-26 23:10:16,183 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3275 transitions. Word has length 206 [2018-10-26 23:10:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:16,183 INFO L481 AbstractCegarLoop]: Abstraction has 2248 states and 3275 transitions. [2018-10-26 23:10:16,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 23:10:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3275 transitions. [2018-10-26 23:10:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-26 23:10:16,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:16,189 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-10-26 23:10:16,189 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:16,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1430859666, now seen corresponding path program 1 times [2018-10-26 23:10:16,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:10:16,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:10:16,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:16,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:10:16,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:10:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:10:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:10:16,576 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 23:10:16,604 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:10:16,605 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:10:16,607 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:10:16,608 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:10:16,609 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:10:16,615 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:10:16,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:10:16 BoogieIcfgContainer [2018-10-26 23:10:16,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:10:16,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:10:16,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:10:16,738 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:10:16,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:08:01" (3/4) ... [2018-10-26 23:10:16,742 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 23:10:16,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:10:16,743 INFO L168 Benchmark]: Toolchain (without parser) took 138964.12 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 958.1 MB in the beginning and 1.6 GB in the end (delta: -675.3 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-10-26 23:10:16,743 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:10:16,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 993.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 958.1 MB in the beginning and 1.2 GB in the end (delta: -218.7 MB). Peak memory consumption was 186.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:10:16,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:10:16,750 INFO L168 Benchmark]: Boogie Preprocessor took 123.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-10-26 23:10:16,750 INFO L168 Benchmark]: RCFGBuilder took 2314.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 995.4 MB in the end (delta: 163.1 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:10:16,750 INFO L168 Benchmark]: TraceAbstraction took 135396.30 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 995.4 MB in the beginning and 1.6 GB in the end (delta: -638.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-10-26 23:10:16,751 INFO L168 Benchmark]: Witness Printer took 4.40 ms. Allocated memory is still 5.1 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:10:16,752 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.45 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 993.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 958.1 MB in the beginning and 1.2 GB in the end (delta: -218.7 MB). Peak memory consumption was 186.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2314.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 995.4 MB in the end (delta: 163.1 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 135396.30 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 995.4 MB in the beginning and 1.6 GB in the end (delta: -638.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 4.40 ms. Allocated memory is still 5.1 GB. Free memory is still 1.6 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, 135.3s OverallTime, 37 OverallIterations, 7 TraceHistogramMax, 24.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, 19.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 993 GetRequests, 842 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 6.8s 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, 96.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 7916 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.1s 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-10-26 23:10:18,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:10:18,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:10:18,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:10:18,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:10:18,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:10:18,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:10:18,914 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:10:18,915 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:10:18,916 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:10:18,917 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:10:18,917 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:10:18,918 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:10:18,919 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:10:18,920 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:10:18,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:10:18,922 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:10:18,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:10:18,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:10:18,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:10:18,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:10:18,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:10:18,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:10:18,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:10:18,932 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:10:18,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:10:18,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:10:18,935 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:10:18,936 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:10:18,937 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:10:18,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:10:18,938 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:10:18,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:10:18,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:10:18,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:10:18,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:10:18,942 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 23:10:18,955 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:10:18,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:10:18,956 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:10:18,956 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:10:18,956 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:10:18,957 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:10:18,957 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:10:18,957 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:10:18,958 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:10:18,958 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:10:18,958 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:10:18,958 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:10:18,958 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:10:18,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:10:18,959 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:10:18,959 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 23:10:18,959 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 23:10:18,959 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:10:18,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:10:18,964 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:10:18,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:10:18,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:10:18,965 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:10:18,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:10:18,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:10:18,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:10:18,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:10:18,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:10:18,966 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 23:10:18,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:10:18,966 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 23:10:18,966 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 23:10:18,966 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_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:19,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:10:19,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:10:19,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:10:19,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:10:19,024 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:10:19,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-10-26 23:10:19,073 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data/7a8db4a10/9a01526221904c36887e60a1ac8f76d0/FLAG41b01dd4f [2018-10-26 23:10:19,648 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:10:19,649 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-10-26 23:10:19,675 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data/7a8db4a10/9a01526221904c36887e60a1ac8f76d0/FLAG41b01dd4f [2018-10-26 23:10:19,689 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/data/7a8db4a10/9a01526221904c36887e60a1ac8f76d0 [2018-10-26 23:10:19,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:10:19,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:10:19,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:10:19,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:10:19,697 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:10:19,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:10:19" (1/1) ... [2018-10-26 23:10:19,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487ce83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:19, skipping insertion in model container [2018-10-26 23:10:19,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:10:19" (1/1) ... [2018-10-26 23:10:19,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:10:19,785 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:10:20,474 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:10:20,486 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:10:20,902 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:10:20,918 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:10:20,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20 WrapperNode [2018-10-26 23:10:20,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:10:20,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:10:20,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:10:20,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:10:20,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:10:21,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:10:21,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:10:21,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:10:21,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... [2018-10-26 23:10:21,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:10:21,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:10:21,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:10:21,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:10:21,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:10:21,344 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:10:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-10-26 23:10:21,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-10-26 23:10:21,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:10:21,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:10:21,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:10:21,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:10:23,940 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:10:23,940 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:10:25,782 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:10:25,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:10:25 BoogieIcfgContainer [2018-10-26 23:10:25,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:10:25,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:10:25,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:10:25,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:10:25,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:10:19" (1/3) ... [2018-10-26 23:10:25,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0dc566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:10:25, skipping insertion in model container [2018-10-26 23:10:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:10:20" (2/3) ... [2018-10-26 23:10:25,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0dc566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:10:25, skipping insertion in model container [2018-10-26 23:10:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:10:25" (3/3) ... [2018-10-26 23:10:25,788 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-10-26 23:10:25,793 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:10:25,799 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:10:25,807 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:10:25,830 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 23:10:25,831 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:10:25,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:10:25,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:10:25,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:10:25,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:10:25,832 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:10:25,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:10:25,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:10:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-10-26 23:10:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 23:10:25,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:25,860 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-10-26 23:10:25,861 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:25,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:25,865 INFO L82 PathProgramCache]: Analyzing trace with hash -264402800, now seen corresponding path program 1 times [2018-10-26 23:10:25,869 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:25,870 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:25,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:26,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:26,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:26,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:10:26,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:26,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:26,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:26,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:10:26,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:26,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:26,917 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-10-26 23:10:26,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:27,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:27,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-10-26 23:10:27,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:10:27,341 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 23:10:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:10:27,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 23:10:27,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:10:27,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:10:27,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:10:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:10:27,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:10:27,382 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 6 states. [2018-10-26 23:10:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:30,711 INFO L93 Difference]: Finished difference Result 358 states and 605 transitions. [2018-10-26 23:10:30,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:10:30,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-10-26 23:10:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:30,724 INFO L225 Difference]: With dead ends: 358 [2018-10-26 23:10:30,724 INFO L226 Difference]: Without dead ends: 182 [2018-10-26 23:10:30,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:10:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-26 23:10:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2018-10-26 23:10:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-26 23:10:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 256 transitions. [2018-10-26 23:10:30,771 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 256 transitions. Word has length 51 [2018-10-26 23:10:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:30,771 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 256 transitions. [2018-10-26 23:10:30,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:10:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 256 transitions. [2018-10-26 23:10:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 23:10:30,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:30,773 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-10-26 23:10:30,774 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:30,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash -311734117, now seen corresponding path program 1 times [2018-10-26 23:10:30,775 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:31,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:31,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:31,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:10:31,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:31,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:31,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:31,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:10:31,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:31,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:31,544 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-10-26 23:10:31,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:31,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:31,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-10-26 23:10:31,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:10:31,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:31,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:10:31,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:31,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:31,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:31,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:10:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:10:31,818 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:10:31,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:10:31,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:10:31,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:10:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:10:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:10:31,830 INFO L87 Difference]: Start difference. First operand 165 states and 256 transitions. Second operand 6 states. [2018-10-26 23:10:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:35,470 INFO L93 Difference]: Finished difference Result 321 states and 496 transitions. [2018-10-26 23:10:35,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:10:35,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-10-26 23:10:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:35,472 INFO L225 Difference]: With dead ends: 321 [2018-10-26 23:10:35,472 INFO L226 Difference]: Without dead ends: 182 [2018-10-26 23:10:35,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:10:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-26 23:10:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2018-10-26 23:10:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-26 23:10:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 255 transitions. [2018-10-26 23:10:35,484 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 255 transitions. Word has length 65 [2018-10-26 23:10:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:35,484 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 255 transitions. [2018-10-26 23:10:35,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:10:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 255 transitions. [2018-10-26 23:10:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 23:10:35,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:35,486 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-10-26 23:10:35,486 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:35,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1166381172, now seen corresponding path program 1 times [2018-10-26 23:10:35,487 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:35,487 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:35,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:35,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:35,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:35,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:10:35,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:35,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:35,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:35,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:10:35,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:10:35,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:10:35,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:35,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:35,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:35,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:10:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:10:35,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:10:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:10:35,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:10:35,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:10:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:10:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:10:35,921 INFO L87 Difference]: Start difference. First operand 165 states and 255 transitions. Second operand 4 states. [2018-10-26 23:10:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:38,457 INFO L93 Difference]: Finished difference Result 334 states and 518 transitions. [2018-10-26 23:10:38,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:10:38,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-10-26 23:10:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:38,459 INFO L225 Difference]: With dead ends: 334 [2018-10-26 23:10:38,460 INFO L226 Difference]: Without dead ends: 195 [2018-10-26 23:10:38,460 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-10-26 23:10:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-26 23:10:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2018-10-26 23:10:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-26 23:10:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 282 transitions. [2018-10-26 23:10:38,473 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 282 transitions. Word has length 66 [2018-10-26 23:10:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:38,474 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 282 transitions. [2018-10-26 23:10:38,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:10:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 282 transitions. [2018-10-26 23:10:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 23:10:38,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:38,477 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-10-26 23:10:38,477 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:38,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash 284791744, now seen corresponding path program 1 times [2018-10-26 23:10:38,478 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:38,478 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:38,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:38,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:38,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:10:38,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:10:38,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:38,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:38,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:38,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:10:39,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 19 treesize of output 15 [2018-10-26 23:10:39,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:10:39,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:39,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:39,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:39,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:10:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:10:39,051 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:10:39,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:10:39,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:10:39,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:10:39,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:10:39,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:10:39,062 INFO L87 Difference]: Start difference. First operand 182 states and 282 transitions. Second operand 4 states. [2018-10-26 23:10:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:41,845 INFO L93 Difference]: Finished difference Result 459 states and 719 transitions. [2018-10-26 23:10:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:10:41,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-10-26 23:10:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:41,850 INFO L225 Difference]: With dead ends: 459 [2018-10-26 23:10:41,850 INFO L226 Difference]: Without dead ends: 303 [2018-10-26 23:10:41,851 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-10-26 23:10:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-26 23:10:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 223. [2018-10-26 23:10:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-26 23:10:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 356 transitions. [2018-10-26 23:10:41,869 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 356 transitions. Word has length 66 [2018-10-26 23:10:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:41,870 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 356 transitions. [2018-10-26 23:10:41,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:10:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 356 transitions. [2018-10-26 23:10:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 23:10:41,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:41,873 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-10-26 23:10:41,874 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:41,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -215859777, now seen corresponding path program 1 times [2018-10-26 23:10:41,875 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:41,875 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:41,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:42,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:42,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:42,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:10:42,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:10:42,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:42,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:42,573 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-10-26 23:10:42,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:10:42,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:42,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-10-26 23:10:42,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:42,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:10:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:10:42,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:10:42,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:10:42,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:10:42,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:10:42,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:10:42,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:10:42,677 INFO L87 Difference]: Start difference. First operand 223 states and 356 transitions. Second operand 6 states. [2018-10-26 23:10:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:45,412 INFO L93 Difference]: Finished difference Result 435 states and 695 transitions. [2018-10-26 23:10:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:10:45,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-10-26 23:10:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:45,414 INFO L225 Difference]: With dead ends: 435 [2018-10-26 23:10:45,414 INFO L226 Difference]: Without dead ends: 238 [2018-10-26 23:10:45,415 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-10-26 23:10:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-26 23:10:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 223. [2018-10-26 23:10:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-26 23:10:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 355 transitions. [2018-10-26 23:10:45,426 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 355 transitions. Word has length 66 [2018-10-26 23:10:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:45,426 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 355 transitions. [2018-10-26 23:10:45,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:10:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 355 transitions. [2018-10-26 23:10:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 23:10:45,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:45,429 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-10-26 23:10:45,429 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:45,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2048488820, now seen corresponding path program 1 times [2018-10-26 23:10:45,430 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:45,430 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:45,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:46,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:46,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:46,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:10:46,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,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-10-26 23:10:46,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 23:10:46,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:10:46,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:46,390 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-10-26 23:10:46,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:10:46,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:10:46,421 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:46,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:10:46,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:10:46,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:46,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:46,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:10:46,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:10:46,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:46,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:10:46,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:46,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-10-26 23:10:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:10:46,509 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:10:46,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:10:46,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 23:10:46,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:10:46,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:10:46,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:10:46,521 INFO L87 Difference]: Start difference. First operand 223 states and 355 transitions. Second operand 8 states. [2018-10-26 23:10:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:52,270 INFO L93 Difference]: Finished difference Result 429 states and 687 transitions. [2018-10-26 23:10:52,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:10:52,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-10-26 23:10:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:52,272 INFO L225 Difference]: With dead ends: 429 [2018-10-26 23:10:52,272 INFO L226 Difference]: Without dead ends: 232 [2018-10-26 23:10:52,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:10:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-26 23:10:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-10-26 23:10:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-26 23:10:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 366 transitions. [2018-10-26 23:10:52,283 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 366 transitions. Word has length 67 [2018-10-26 23:10:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:52,284 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 366 transitions. [2018-10-26 23:10:52,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:10:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 366 transitions. [2018-10-26 23:10:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 23:10:52,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:52,286 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-10-26 23:10:52,286 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:52,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1839958664, now seen corresponding path program 1 times [2018-10-26 23:10:52,287 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:52,289 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:52,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:53,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:53,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:53,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:10:53,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:10:53,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:10:53,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:10:53,101 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-10-26 23:10:53,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:10:53,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:53,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:10:53,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:53,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:10:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:10:53,146 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:10:53,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:10:53,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:10:53,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:10:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:10:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:10:53,150 INFO L87 Difference]: Start difference. First operand 232 states and 366 transitions. Second operand 6 states. [2018-10-26 23:10:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:55,973 INFO L93 Difference]: Finished difference Result 462 states and 727 transitions. [2018-10-26 23:10:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:10:55,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-10-26 23:10:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:55,974 INFO L225 Difference]: With dead ends: 462 [2018-10-26 23:10:55,975 INFO L226 Difference]: Without dead ends: 256 [2018-10-26 23:10:55,975 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-10-26 23:10:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-26 23:10:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 232. [2018-10-26 23:10:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-26 23:10:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 365 transitions. [2018-10-26 23:10:55,986 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 365 transitions. Word has length 67 [2018-10-26 23:10:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:55,986 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 365 transitions. [2018-10-26 23:10:55,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:10:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2018-10-26 23:10:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 23:10:55,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:55,987 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-10-26 23:10:55,987 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:55,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1267965161, now seen corresponding path program 1 times [2018-10-26 23:10:55,989 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:55,990 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:56,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:10:56,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:10:56,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-10-26 23:10:56,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:10:56,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:56,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:56,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:56,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:10:56,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:10:56,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:10:56,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:10:56,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:56,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:10:56,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:10:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:10:56,421 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:10:56,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:10:56,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:10:56,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:10:56,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:10:56,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:10:56,425 INFO L87 Difference]: Start difference. First operand 232 states and 365 transitions. Second operand 4 states. [2018-10-26 23:10:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:10:59,188 INFO L93 Difference]: Finished difference Result 518 states and 810 transitions. [2018-10-26 23:10:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:10:59,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-26 23:10:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:10:59,204 INFO L225 Difference]: With dead ends: 518 [2018-10-26 23:10:59,205 INFO L226 Difference]: Without dead ends: 312 [2018-10-26 23:10:59,205 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-10-26 23:10:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-26 23:10:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 233. [2018-10-26 23:10:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-26 23:10:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 366 transitions. [2018-10-26 23:10:59,222 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 366 transitions. Word has length 67 [2018-10-26 23:10:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:10:59,224 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 366 transitions. [2018-10-26 23:10:59,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:10:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 366 transitions. [2018-10-26 23:10:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-26 23:10:59,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:10:59,225 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-10-26 23:10:59,225 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:10:59,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:10:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash -56165668, now seen corresponding path program 1 times [2018-10-26 23:10:59,226 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:10:59,226 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:10:59,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:10:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:00,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:00,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:11:00,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:11:00,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:11:00,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:00,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:00,323 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-10-26 23:11:00,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:11:00,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 19 treesize of output 15 [2018-10-26 23:11:00,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:00,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:00,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:11:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:00,397 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:00,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:00,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:11:00,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:11:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:11:00,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:11:00,402 INFO L87 Difference]: Start difference. First operand 233 states and 366 transitions. Second operand 6 states. [2018-10-26 23:11:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:03,257 INFO L93 Difference]: Finished difference Result 464 states and 728 transitions. [2018-10-26 23:11:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:11:03,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-10-26 23:11:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:03,260 INFO L225 Difference]: With dead ends: 464 [2018-10-26 23:11:03,260 INFO L226 Difference]: Without dead ends: 257 [2018-10-26 23:11:03,260 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-10-26 23:11:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-26 23:11:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2018-10-26 23:11:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-26 23:11:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 365 transitions. [2018-10-26 23:11:03,273 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 365 transitions. Word has length 68 [2018-10-26 23:11:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:03,273 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 365 transitions. [2018-10-26 23:11:03,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:11:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 365 transitions. [2018-10-26 23:11:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 23:11:03,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:03,274 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-10-26 23:11:03,275 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:03,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:03,275 INFO L82 PathProgramCache]: Analyzing trace with hash -934716622, now seen corresponding path program 1 times [2018-10-26 23:11:03,277 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:03,278 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:03,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:03,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:03,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:03,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-10-26 23:11:03,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:03,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:11:03,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:03,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:03,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:03,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:03,981 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:11:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:04,024 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:04,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:04,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:11:04,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:11:04,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:11:04,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:11:04,031 INFO L87 Difference]: Start difference. First operand 233 states and 365 transitions. Second operand 7 states. [2018-10-26 23:11:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:06,932 INFO L93 Difference]: Finished difference Result 493 states and 775 transitions. [2018-10-26 23:11:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:11:06,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-10-26 23:11:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:06,934 INFO L225 Difference]: With dead ends: 493 [2018-10-26 23:11:06,934 INFO L226 Difference]: Without dead ends: 286 [2018-10-26 23:11:06,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:11:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-26 23:11:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 256. [2018-10-26 23:11:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 23:11:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 404 transitions. [2018-10-26 23:11:06,953 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 404 transitions. Word has length 69 [2018-10-26 23:11:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:06,953 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 404 transitions. [2018-10-26 23:11:06,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:11:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 404 transitions. [2018-10-26 23:11:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 23:11:06,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:06,955 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-10-26 23:11:06,955 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:06,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1795858285, now seen corresponding path program 1 times [2018-10-26 23:11:06,958 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:06,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:07,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:07,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:11:07,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-10-26 23:11:07,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:11:07,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 23 treesize of output 18 [2018-10-26 23:11:07,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:07,844 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-10-26 23:11:07,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:11:07,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:07,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:07,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:07,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:11:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:07,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:07,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:07,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:11:07,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:11:07,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:11:07,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:11:07,933 INFO L87 Difference]: Start difference. First operand 256 states and 404 transitions. Second operand 6 states. [2018-10-26 23:11:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:10,875 INFO L93 Difference]: Finished difference Result 510 states and 805 transitions. [2018-10-26 23:11:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:11:10,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-10-26 23:11:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:10,876 INFO L225 Difference]: With dead ends: 510 [2018-10-26 23:11:10,877 INFO L226 Difference]: Without dead ends: 280 [2018-10-26 23:11:10,877 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-10-26 23:11:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-26 23:11:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-10-26 23:11:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 23:11:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 403 transitions. [2018-10-26 23:11:10,889 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 403 transitions. Word has length 69 [2018-10-26 23:11:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:10,890 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 403 transitions. [2018-10-26 23:11:10,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:11:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 403 transitions. [2018-10-26 23:11:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-26 23:11:10,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:10,891 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-10-26 23:11:10,891 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:10,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:10,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1094455209, now seen corresponding path program 1 times [2018-10-26 23:11:10,894 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:10,894 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:10,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:11,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:11,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:11,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:11:11,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:11:11,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 23 treesize of output 18 [2018-10-26 23:11:11,750 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:11,752 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-10-26 23:11:11,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:11:11,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:11,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:11,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:11,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:11:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:11,802 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:11,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:11,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:11:11,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:11:11,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:11:11,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:11:11,806 INFO L87 Difference]: Start difference. First operand 256 states and 403 transitions. Second operand 6 states. [2018-10-26 23:11:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:14,506 INFO L93 Difference]: Finished difference Result 500 states and 791 transitions. [2018-10-26 23:11:14,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:11:14,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-10-26 23:11:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:14,508 INFO L225 Difference]: With dead ends: 500 [2018-10-26 23:11:14,508 INFO L226 Difference]: Without dead ends: 270 [2018-10-26 23:11:14,508 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-10-26 23:11:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-26 23:11:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 256. [2018-10-26 23:11:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 23:11:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 402 transitions. [2018-10-26 23:11:14,517 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 402 transitions. Word has length 70 [2018-10-26 23:11:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:14,517 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 402 transitions. [2018-10-26 23:11:14,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:11:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 402 transitions. [2018-10-26 23:11:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 23:11:14,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:14,518 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-10-26 23:11:14,518 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:14,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1812314495, now seen corresponding path program 1 times [2018-10-26 23:11:14,519 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:14,519 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:14,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:15,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:15,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:11:15,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:11:15,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:11:15,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:15,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:15,415 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-10-26 23:11:15,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:11:15,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:11:15,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:15,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:15,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:11:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:11:15,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:15,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:15,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:11:15,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:11:15,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:11:15,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:11:15,452 INFO L87 Difference]: Start difference. First operand 256 states and 402 transitions. Second operand 6 states. [2018-10-26 23:11:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:18,238 INFO L93 Difference]: Finished difference Result 490 states and 778 transitions. [2018-10-26 23:11:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:11:18,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-10-26 23:11:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:18,239 INFO L225 Difference]: With dead ends: 490 [2018-10-26 23:11:18,240 INFO L226 Difference]: Without dead ends: 260 [2018-10-26 23:11:18,240 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-10-26 23:11:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-26 23:11:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 256. [2018-10-26 23:11:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 23:11:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 401 transitions. [2018-10-26 23:11:18,251 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 401 transitions. Word has length 80 [2018-10-26 23:11:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:18,251 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 401 transitions. [2018-10-26 23:11:18,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:11:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 401 transitions. [2018-10-26 23:11:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 23:11:18,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:18,253 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-10-26 23:11:18,253 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:18,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1541146571, now seen corresponding path program 1 times [2018-10-26 23:11:18,254 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:18,254 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:18,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:18,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:18,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:18,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:11:18,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:18,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:18,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:18,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:11:18,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:11:18,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:11:18,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:18,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:18,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:18,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:11:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:18,888 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:18,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:18,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:11:18,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:11:18,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:11:18,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:11:18,894 INFO L87 Difference]: Start difference. First operand 256 states and 401 transitions. Second operand 4 states. [2018-10-26 23:11:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:21,697 INFO L93 Difference]: Finished difference Result 565 states and 884 transitions. [2018-10-26 23:11:21,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:11:21,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-10-26 23:11:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:21,699 INFO L225 Difference]: With dead ends: 565 [2018-10-26 23:11:21,699 INFO L226 Difference]: Without dead ends: 335 [2018-10-26 23:11:21,699 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-10-26 23:11:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-26 23:11:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 256. [2018-10-26 23:11:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 23:11:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 400 transitions. [2018-10-26 23:11:21,707 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 400 transitions. Word has length 80 [2018-10-26 23:11:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:21,707 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 400 transitions. [2018-10-26 23:11:21,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:11:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 400 transitions. [2018-10-26 23:11:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 23:11:21,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:21,708 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-10-26 23:11:21,709 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:21,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1388866703, now seen corresponding path program 1 times [2018-10-26 23:11:21,709 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:21,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:22,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:22,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:22,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-10-26 23:11:22,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:22,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:22,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:22,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:11:22,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:22,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:11:22,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:22,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:22,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:22,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:11:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:22,194 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:11:22,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:11:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:11:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:11:22,198 INFO L87 Difference]: Start difference. First operand 256 states and 400 transitions. Second operand 4 states. [2018-10-26 23:11:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:24,854 INFO L93 Difference]: Finished difference Result 563 states and 880 transitions. [2018-10-26 23:11:24,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:11:24,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-10-26 23:11:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:24,856 INFO L225 Difference]: With dead ends: 563 [2018-10-26 23:11:24,856 INFO L226 Difference]: Without dead ends: 333 [2018-10-26 23:11:24,856 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-10-26 23:11:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-26 23:11:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2018-10-26 23:11:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 23:11:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 399 transitions. [2018-10-26 23:11:24,868 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 399 transitions. Word has length 81 [2018-10-26 23:11:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:24,868 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 399 transitions. [2018-10-26 23:11:24,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:11:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 399 transitions. [2018-10-26 23:11:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 23:11:24,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:24,870 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-10-26 23:11:24,870 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:24,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash 661921960, now seen corresponding path program 1 times [2018-10-26 23:11:24,871 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:24,871 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:24,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:25,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:25,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:25,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:11:25,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:25,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:25,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:25,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:11:25,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:11:25,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-10-26 23:11:25,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:25,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:25,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:25,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:11:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:25,358 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:25,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:25,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:11:25,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:11:25,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:11:25,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:11:25,361 INFO L87 Difference]: Start difference. First operand 256 states and 399 transitions. Second operand 4 states. [2018-10-26 23:11:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:28,102 INFO L93 Difference]: Finished difference Result 563 states and 878 transitions. [2018-10-26 23:11:28,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:11:28,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-10-26 23:11:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:28,104 INFO L225 Difference]: With dead ends: 563 [2018-10-26 23:11:28,104 INFO L226 Difference]: Without dead ends: 333 [2018-10-26 23:11:28,105 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-10-26 23:11:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-26 23:11:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2018-10-26 23:11:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 23:11:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2018-10-26 23:11:28,119 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 82 [2018-10-26 23:11:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:28,119 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2018-10-26 23:11:28,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:11:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2018-10-26 23:11:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 23:11:28,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:28,121 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-10-26 23:11:28,121 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:28,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash 192722348, now seen corresponding path program 1 times [2018-10-26 23:11:28,122 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:28,122 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:28,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:28,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:28,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:28,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:11:28,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:28,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:28,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:28,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:11:28,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:28,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:28,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:28,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:28,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:28,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:11:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:28,913 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:28,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:28,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:11:28,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:11:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:11:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:11:28,917 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 4 states. [2018-10-26 23:11:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:31,764 INFO L93 Difference]: Finished difference Result 563 states and 876 transitions. [2018-10-26 23:11:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:11:31,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-10-26 23:11:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:31,766 INFO L225 Difference]: With dead ends: 563 [2018-10-26 23:11:31,766 INFO L226 Difference]: Without dead ends: 333 [2018-10-26 23:11:31,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:11:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-26 23:11:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2018-10-26 23:11:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 23:11:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 397 transitions. [2018-10-26 23:11:31,778 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 397 transitions. Word has length 83 [2018-10-26 23:11:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:31,779 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 397 transitions. [2018-10-26 23:11:31,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:11:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 397 transitions. [2018-10-26 23:11:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 23:11:31,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:31,781 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-10-26 23:11:31,781 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:31,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash 809033661, now seen corresponding path program 1 times [2018-10-26 23:11:31,782 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:31,782 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:32,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:32,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:32,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:11:32,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:32,690 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-10-26 23:11:32,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,711 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:11:32,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:32,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:32,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:11:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:32,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:11:32,768 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:11:32,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:32,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:11:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:32,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:11:32,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:11:32,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:11:32,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:11:32,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:11:32,780 INFO L87 Difference]: Start difference. First operand 256 states and 397 transitions. Second operand 9 states. [2018-10-26 23:11:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:35,906 INFO L93 Difference]: Finished difference Result 659 states and 1026 transitions. [2018-10-26 23:11:35,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:11:35,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-10-26 23:11:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:35,908 INFO L225 Difference]: With dead ends: 659 [2018-10-26 23:11:35,908 INFO L226 Difference]: Without dead ends: 429 [2018-10-26 23:11:35,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 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-10-26 23:11:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-26 23:11:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 273. [2018-10-26 23:11:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-26 23:11:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 423 transitions. [2018-10-26 23:11:35,922 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 423 transitions. Word has length 83 [2018-10-26 23:11:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:35,922 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 423 transitions. [2018-10-26 23:11:35,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:11:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 423 transitions. [2018-10-26 23:11:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-26 23:11:35,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:35,923 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-10-26 23:11:35,925 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:35,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:35,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1624702915, now seen corresponding path program 1 times [2018-10-26 23:11:35,926 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:35,926 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:35,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:36,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:36,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:36,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:11:36,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:36,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:36,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:36,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:11:36,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:36,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:36,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:36,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:36,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:36,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:11:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:36,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:36,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:36,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:11:36,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:11:36,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:11:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:11:36,377 INFO L87 Difference]: Start difference. First operand 273 states and 423 transitions. Second operand 4 states. [2018-10-26 23:11:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:39,340 INFO L93 Difference]: Finished difference Result 597 states and 926 transitions. [2018-10-26 23:11:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:11:39,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-10-26 23:11:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:39,342 INFO L225 Difference]: With dead ends: 597 [2018-10-26 23:11:39,342 INFO L226 Difference]: Without dead ends: 350 [2018-10-26 23:11:39,343 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-10-26 23:11:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-26 23:11:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 273. [2018-10-26 23:11:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-26 23:11:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 422 transitions. [2018-10-26 23:11:39,363 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 422 transitions. Word has length 84 [2018-10-26 23:11:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:39,363 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 422 transitions. [2018-10-26 23:11:39,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:11:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 422 transitions. [2018-10-26 23:11:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-26 23:11:39,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:39,364 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-10-26 23:11:39,365 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:39,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash 168202973, now seen corresponding path program 1 times [2018-10-26 23:11:39,365 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:39,366 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:39,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:40,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:40,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:11:40,338 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:40,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:11:40,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,369 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:11:40,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 17 treesize of output 13 [2018-10-26 23:11:40,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 23:11:40,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:11:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:40,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:11:40,635 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:11:40,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:40,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:11:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:40,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:11:40,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:11:40,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:11:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:11:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:11:40,720 INFO L87 Difference]: Start difference. First operand 273 states and 422 transitions. Second operand 9 states. [2018-10-26 23:11:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:44,624 INFO L93 Difference]: Finished difference Result 674 states and 1046 transitions. [2018-10-26 23:11:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:11:44,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-10-26 23:11:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:44,627 INFO L225 Difference]: With dead ends: 674 [2018-10-26 23:11:44,627 INFO L226 Difference]: Without dead ends: 427 [2018-10-26 23:11:44,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:11:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-26 23:11:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 274. [2018-10-26 23:11:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 23:11:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 422 transitions. [2018-10-26 23:11:44,642 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 422 transitions. Word has length 84 [2018-10-26 23:11:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:44,642 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 422 transitions. [2018-10-26 23:11:44,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:11:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 422 transitions. [2018-10-26 23:11:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-26 23:11:44,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:44,645 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-10-26 23:11:44,646 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:44,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1863726887, now seen corresponding path program 1 times [2018-10-26 23:11:44,646 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:44,647 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:44,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:45,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:45,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:45,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:11:45,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:45,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:45,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:45,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:11:45,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:45,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:45,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:45,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:45,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:45,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:11:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:45,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:45,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:45,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:11:45,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:11:45,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:11:45,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:11:45,296 INFO L87 Difference]: Start difference. First operand 274 states and 422 transitions. Second operand 4 states. [2018-10-26 23:11:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:48,029 INFO L93 Difference]: Finished difference Result 589 states and 911 transitions. [2018-10-26 23:11:48,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:11:48,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-10-26 23:11:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:48,034 INFO L225 Difference]: With dead ends: 589 [2018-10-26 23:11:48,035 INFO L226 Difference]: Without dead ends: 341 [2018-10-26 23:11:48,035 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-10-26 23:11:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-26 23:11:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 274. [2018-10-26 23:11:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 23:11:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 421 transitions. [2018-10-26 23:11:48,047 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 421 transitions. Word has length 85 [2018-10-26 23:11:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:48,047 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 421 transitions. [2018-10-26 23:11:48,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:11:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 421 transitions. [2018-10-26 23:11:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-26 23:11:48,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:48,049 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-10-26 23:11:48,049 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:48,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1476051994, now seen corresponding path program 1 times [2018-10-26 23:11:48,050 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:48,050 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:48,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:48,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:49,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:11:49,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:11:49,070 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:49,072 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-10-26 23:11:49,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:49,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:49,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:49,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:49,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:11:49,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:49,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:49,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:49,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:49,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:49,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:11:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:49,122 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:49,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:49,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:11:49,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:11:49,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:11:49,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:11:49,126 INFO L87 Difference]: Start difference. First operand 274 states and 421 transitions. Second operand 7 states. [2018-10-26 23:11:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:50,001 INFO L93 Difference]: Finished difference Result 550 states and 848 transitions. [2018-10-26 23:11:50,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:11:50,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-10-26 23:11:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:50,004 INFO L225 Difference]: With dead ends: 550 [2018-10-26 23:11:50,005 INFO L226 Difference]: Without dead ends: 302 [2018-10-26 23:11:50,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:11:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-26 23:11:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 274. [2018-10-26 23:11:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 23:11:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 420 transitions. [2018-10-26 23:11:50,025 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 420 transitions. Word has length 85 [2018-10-26 23:11:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:50,026 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 420 transitions. [2018-10-26 23:11:50,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:11:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 420 transitions. [2018-10-26 23:11:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 23:11:50,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:50,027 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-10-26 23:11:50,027 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:50,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:50,029 INFO L82 PathProgramCache]: Analyzing trace with hash -339050374, now seen corresponding path program 1 times [2018-10-26 23:11:50,030 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:50,030 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:50,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:50,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:51,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:11:51,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:11:51,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:51,097 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-10-26 23:11:51,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:51,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:51,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:51,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:51,116 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:11:51,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:51,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:51,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:51,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:51,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:51,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:11:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:51,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:51,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:51,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:11:51,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:11:51,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:11:51,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:11:51,152 INFO L87 Difference]: Start difference. First operand 274 states and 420 transitions. Second operand 7 states. [2018-10-26 23:11:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:54,112 INFO L93 Difference]: Finished difference Result 550 states and 846 transitions. [2018-10-26 23:11:54,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:11:54,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2018-10-26 23:11:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:54,114 INFO L225 Difference]: With dead ends: 550 [2018-10-26 23:11:54,114 INFO L226 Difference]: Without dead ends: 302 [2018-10-26 23:11:54,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:11:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-26 23:11:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 274. [2018-10-26 23:11:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 23:11:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 419 transitions. [2018-10-26 23:11:54,129 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 419 transitions. Word has length 86 [2018-10-26 23:11:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:54,130 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 419 transitions. [2018-10-26 23:11:54,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:11:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 419 transitions. [2018-10-26 23:11:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 23:11:54,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:54,131 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-10-26 23:11:54,131 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:54,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1975349579, now seen corresponding path program 1 times [2018-10-26 23:11:54,134 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:54,134 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:54,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:55,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:55,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 18 treesize of output 15 [2018-10-26 23:11:55,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:11:55,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:55,150 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-10-26 23:11:55,150 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:55,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:55,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:55,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:55,172 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:11:55,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:55,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:55,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:55,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:55,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:55,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:11:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:55,204 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:55,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:55,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:11:55,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:11:55,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:11:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:11:55,208 INFO L87 Difference]: Start difference. First operand 274 states and 419 transitions. Second operand 7 states. [2018-10-26 23:11:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:11:58,297 INFO L93 Difference]: Finished difference Result 550 states and 844 transitions. [2018-10-26 23:11:58,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:11:58,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-10-26 23:11:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:11:58,300 INFO L225 Difference]: With dead ends: 550 [2018-10-26 23:11:58,300 INFO L226 Difference]: Without dead ends: 302 [2018-10-26 23:11:58,300 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-10-26 23:11:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-26 23:11:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 274. [2018-10-26 23:11:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 23:11:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 418 transitions. [2018-10-26 23:11:58,319 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 418 transitions. Word has length 87 [2018-10-26 23:11:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:11:58,319 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 418 transitions. [2018-10-26 23:11:58,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:11:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 418 transitions. [2018-10-26 23:11:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-26 23:11:58,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:11:58,322 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-10-26 23:11:58,322 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:11:58,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:11:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1931249269, now seen corresponding path program 1 times [2018-10-26 23:11:58,323 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:11:58,323 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:11:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:11:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:11:59,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:11:59,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:11:59,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:11:59,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:11:59,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-10-26 23:11:59,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:59,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:59,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:59,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-10-26 23:11:59,253 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:11:59,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:11:59,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:11:59,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:11:59,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:59,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:11:59,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:11:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:11:59,292 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:11:59,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:11:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:11:59,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:11:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:11:59,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:11:59,296 INFO L87 Difference]: Start difference. First operand 274 states and 418 transitions. Second operand 7 states. [2018-10-26 23:12:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:02,370 INFO L93 Difference]: Finished difference Result 540 states and 829 transitions. [2018-10-26 23:12:02,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:12:02,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-10-26 23:12:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:02,372 INFO L225 Difference]: With dead ends: 540 [2018-10-26 23:12:02,372 INFO L226 Difference]: Without dead ends: 292 [2018-10-26 23:12:02,373 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-10-26 23:12:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-26 23:12:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 274. [2018-10-26 23:12:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 23:12:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 417 transitions. [2018-10-26 23:12:02,390 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 417 transitions. Word has length 88 [2018-10-26 23:12:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:02,390 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 417 transitions. [2018-10-26 23:12:02,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:12:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 417 transitions. [2018-10-26 23:12:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 23:12:02,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:02,393 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-10-26 23:12:02,394 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:02,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:02,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1957671745, now seen corresponding path program 1 times [2018-10-26 23:12:02,394 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:02,395 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:02,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:02,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 23:12:02,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:02,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:02,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:12:02,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:12:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:12:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:12:02,551 INFO L87 Difference]: Start difference. First operand 274 states and 417 transitions. Second operand 3 states. [2018-10-26 23:12:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:02,662 INFO L93 Difference]: Finished difference Result 742 states and 1152 transitions. [2018-10-26 23:12:02,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:12:02,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-10-26 23:12:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:02,664 INFO L225 Difference]: With dead ends: 742 [2018-10-26 23:12:02,664 INFO L226 Difference]: Without dead ends: 494 [2018-10-26 23:12:02,665 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-10-26 23:12:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-10-26 23:12:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2018-10-26 23:12:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-26 23:12:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 743 transitions. [2018-10-26 23:12:02,697 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 743 transitions. Word has length 89 [2018-10-26 23:12:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:02,697 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 743 transitions. [2018-10-26 23:12:02,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:12:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 743 transitions. [2018-10-26 23:12:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 23:12:02,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:02,698 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-10-26 23:12:02,699 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:02,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1064185407, now seen corresponding path program 1 times [2018-10-26 23:12:02,699 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:02,699 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:02,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:03,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:03,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:12:03,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:03,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:03,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:03,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:03,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:03,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:03,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:12:03,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:03,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:03,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:03,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:03,298 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:03,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:03,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:03,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:03,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:03,301 INFO L87 Difference]: Start difference. First operand 492 states and 743 transitions. Second operand 4 states. [2018-10-26 23:12:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:05,952 INFO L93 Difference]: Finished difference Result 1091 states and 1634 transitions. [2018-10-26 23:12:05,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:05,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-10-26 23:12:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:05,959 INFO L225 Difference]: With dead ends: 1091 [2018-10-26 23:12:05,959 INFO L226 Difference]: Without dead ends: 625 [2018-10-26 23:12:05,960 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-10-26 23:12:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-26 23:12:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 492. [2018-10-26 23:12:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-26 23:12:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 741 transitions. [2018-10-26 23:12:05,980 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 741 transitions. Word has length 89 [2018-10-26 23:12:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:05,980 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 741 transitions. [2018-10-26 23:12:05,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 741 transitions. [2018-10-26 23:12:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 23:12:05,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:05,982 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-10-26 23:12:05,982 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:05,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash 713056781, now seen corresponding path program 1 times [2018-10-26 23:12:05,983 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:05,983 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:06,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:06,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:06,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 13 treesize of output 10 [2018-10-26 23:12:06,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:06,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:06,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:06,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:06,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:06,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:06,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-10-26 23:12:06,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:06,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:06,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:06,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:06,572 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:06,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:06,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:06,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:06,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:06,576 INFO L87 Difference]: Start difference. First operand 492 states and 741 transitions. Second operand 4 states. [2018-10-26 23:12:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:09,216 INFO L93 Difference]: Finished difference Result 1091 states and 1630 transitions. [2018-10-26 23:12:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:09,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-10-26 23:12:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:09,222 INFO L225 Difference]: With dead ends: 1091 [2018-10-26 23:12:09,222 INFO L226 Difference]: Without dead ends: 625 [2018-10-26 23:12:09,223 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-10-26 23:12:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-26 23:12:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 492. [2018-10-26 23:12:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-26 23:12:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 739 transitions. [2018-10-26 23:12:09,254 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 739 transitions. Word has length 89 [2018-10-26 23:12:09,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:09,254 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 739 transitions. [2018-10-26 23:12:09,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 739 transitions. [2018-10-26 23:12:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 23:12:09,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:09,257 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-10-26 23:12:09,257 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:09,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash -455390371, now seen corresponding path program 1 times [2018-10-26 23:12:09,258 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:09,259 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:09,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:09,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:09,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:09,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-10-26 23:12:09,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:09,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:09,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:09,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:09,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 19 treesize of output 15 [2018-10-26 23:12:09,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:12:09,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:09,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:09,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:09,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:09,997 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:10,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:10,001 INFO L87 Difference]: Start difference. First operand 492 states and 739 transitions. Second operand 4 states. [2018-10-26 23:12:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:12,934 INFO L93 Difference]: Finished difference Result 1083 states and 1615 transitions. [2018-10-26 23:12:12,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:12,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-26 23:12:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:12,937 INFO L225 Difference]: With dead ends: 1083 [2018-10-26 23:12:12,937 INFO L226 Difference]: Without dead ends: 617 [2018-10-26 23:12:12,938 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-10-26 23:12:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-26 23:12:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 492. [2018-10-26 23:12:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-26 23:12:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 737 transitions. [2018-10-26 23:12:12,962 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 737 transitions. Word has length 90 [2018-10-26 23:12:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:12,963 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 737 transitions. [2018-10-26 23:12:12,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 737 transitions. [2018-10-26 23:12:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 23:12:12,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:12,964 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-10-26 23:12:12,964 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:12,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -213685175, now seen corresponding path program 1 times [2018-10-26 23:12:12,965 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:12,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:13,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:13,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:13,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:12:13,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:13,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:13,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:13,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:13,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:13,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:12:13,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:13,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:13,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:13,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:13,500 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:13,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:13,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:13,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:13,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:13,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:13,504 INFO L87 Difference]: Start difference. First operand 492 states and 737 transitions. Second operand 4 states. [2018-10-26 23:12:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:16,225 INFO L93 Difference]: Finished difference Result 1073 states and 1598 transitions. [2018-10-26 23:12:16,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:16,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-26 23:12:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:16,227 INFO L225 Difference]: With dead ends: 1073 [2018-10-26 23:12:16,227 INFO L226 Difference]: Without dead ends: 607 [2018-10-26 23:12:16,228 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-10-26 23:12:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-26 23:12:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 492. [2018-10-26 23:12:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-26 23:12:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 735 transitions. [2018-10-26 23:12:16,265 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 735 transitions. Word has length 90 [2018-10-26 23:12:16,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:16,265 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 735 transitions. [2018-10-26 23:12:16,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 735 transitions. [2018-10-26 23:12:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 23:12:16,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:16,267 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-10-26 23:12:16,267 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:16,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1236628968, now seen corresponding path program 1 times [2018-10-26 23:12:16,270 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:16,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:16,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:16,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:16,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 10 treesize of output 9 [2018-10-26 23:12:16,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:16,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:16,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:16,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:16,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-10-26 23:12:16,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 15 treesize of output 3 [2018-10-26 23:12:16,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:16,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:16,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:16,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:16,850 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:16,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:16,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:16,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:16,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:16,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:16,854 INFO L87 Difference]: Start difference. First operand 492 states and 735 transitions. Second operand 4 states. [2018-10-26 23:12:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:19,481 INFO L93 Difference]: Finished difference Result 1073 states and 1594 transitions. [2018-10-26 23:12:19,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:19,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-10-26 23:12:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:19,484 INFO L225 Difference]: With dead ends: 1073 [2018-10-26 23:12:19,484 INFO L226 Difference]: Without dead ends: 607 [2018-10-26 23:12:19,484 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-10-26 23:12:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-26 23:12:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 492. [2018-10-26 23:12:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-26 23:12:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 733 transitions. [2018-10-26 23:12:19,509 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 733 transitions. Word has length 92 [2018-10-26 23:12:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:19,510 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 733 transitions. [2018-10-26 23:12:19,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 733 transitions. [2018-10-26 23:12:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 23:12:19,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:19,511 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-10-26 23:12:19,511 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:19,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:19,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2044871949, now seen corresponding path program 1 times [2018-10-26 23:12:19,512 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:19,512 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:19,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:20,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:20,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:20,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:20,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:12:20,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:20,415 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:12:20,417 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-10-26 23:12:20,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:12:20,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:20,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:12:20,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:20,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:12:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:12:20,457 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:20,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:20,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:12:20,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:12:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:12:20,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:12:20,461 INFO L87 Difference]: Start difference. First operand 492 states and 733 transitions. Second operand 7 states. [2018-10-26 23:12:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:23,963 INFO L93 Difference]: Finished difference Result 996 states and 1492 transitions. [2018-10-26 23:12:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:12:23,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-10-26 23:12:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:23,968 INFO L225 Difference]: With dead ends: 996 [2018-10-26 23:12:23,968 INFO L226 Difference]: Without dead ends: 743 [2018-10-26 23:12:23,969 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-10-26 23:12:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-26 23:12:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 574. [2018-10-26 23:12:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-10-26 23:12:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 877 transitions. [2018-10-26 23:12:23,996 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 877 transitions. Word has length 92 [2018-10-26 23:12:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:23,996 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 877 transitions. [2018-10-26 23:12:23,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:12:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 877 transitions. [2018-10-26 23:12:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 23:12:23,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:23,998 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-10-26 23:12:23,998 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:23,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1147478671, now seen corresponding path program 1 times [2018-10-26 23:12:23,999 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:23,999 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:24,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:24,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:24,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:24,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:24,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:24,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:24,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:12:25,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:25,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:12:25,027 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-10-26 23:12:25,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:25,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:25,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:25,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:12:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:12:25,095 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:25,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:25,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:12:25,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:12:25,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:12:25,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:12:25,099 INFO L87 Difference]: Start difference. First operand 574 states and 877 transitions. Second operand 7 states. [2018-10-26 23:12:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:30,042 INFO L93 Difference]: Finished difference Result 1237 states and 1890 transitions. [2018-10-26 23:12:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:12:30,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-10-26 23:12:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:30,046 INFO L225 Difference]: With dead ends: 1237 [2018-10-26 23:12:30,046 INFO L226 Difference]: Without dead ends: 689 [2018-10-26 23:12:30,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:12:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-10-26 23:12:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 624. [2018-10-26 23:12:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-26 23:12:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 959 transitions. [2018-10-26 23:12:30,072 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 959 transitions. Word has length 92 [2018-10-26 23:12:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:30,072 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 959 transitions. [2018-10-26 23:12:30,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:12:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 959 transitions. [2018-10-26 23:12:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 23:12:30,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12: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-10-26 23:12:30,074 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:30,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash -382480148, now seen corresponding path program 1 times [2018-10-26 23:12:30,074 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:30,074 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:30,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:30,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:30,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:30,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:30,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:30,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:30,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:30,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:30,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:30,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:12:30,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:30,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:30,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:30,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:30,636 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (35)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 23:12:30,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:30,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:30,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:30,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:30,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:30,642 INFO L87 Difference]: Start difference. First operand 624 states and 959 transitions. Second operand 4 states. [2018-10-26 23:12:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:33,369 INFO L93 Difference]: Finished difference Result 1321 states and 2016 transitions. [2018-10-26 23:12:33,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:33,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-10-26 23:12:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:33,373 INFO L225 Difference]: With dead ends: 1321 [2018-10-26 23:12:33,373 INFO L226 Difference]: Without dead ends: 723 [2018-10-26 23:12:33,374 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-10-26 23:12:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-10-26 23:12:33,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 624. [2018-10-26 23:12:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-26 23:12:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 957 transitions. [2018-10-26 23:12:33,399 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 957 transitions. Word has length 93 [2018-10-26 23:12:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:33,399 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 957 transitions. [2018-10-26 23:12:33,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 957 transitions. [2018-10-26 23:12:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 23:12:33,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:33,400 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-10-26 23:12:33,400 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:33,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash -4123332, now seen corresponding path program 1 times [2018-10-26 23:12:33,401 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:33,401 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:33,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:34,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:34,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:34,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:34,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:12:34,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:12:34,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:12:34,344 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-10-26 23:12:34,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:12:34,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:34,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:12:34,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:34,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:12:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:12:34,389 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:34,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:34,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:12:34,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:12:34,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:12:34,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:12:34,393 INFO L87 Difference]: Start difference. First operand 624 states and 957 transitions. Second operand 7 states. [2018-10-26 23:12:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:37,471 INFO L93 Difference]: Finished difference Result 1098 states and 1664 transitions. [2018-10-26 23:12:37,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:12:37,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-10-26 23:12:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:37,475 INFO L225 Difference]: With dead ends: 1098 [2018-10-26 23:12:37,475 INFO L226 Difference]: Without dead ends: 779 [2018-10-26 23:12:37,475 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-10-26 23:12:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-26 23:12:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 604. [2018-10-26 23:12:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-10-26 23:12:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 919 transitions. [2018-10-26 23:12:37,498 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 919 transitions. Word has length 93 [2018-10-26 23:12:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:37,498 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 919 transitions. [2018-10-26 23:12:37,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:12:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 919 transitions. [2018-10-26 23:12:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 23:12:37,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:37,499 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-10-26 23:12:37,500 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:37,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1882651096, now seen corresponding path program 1 times [2018-10-26 23:12:37,500 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:37,500 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:37,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:37,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:37,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:37,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:37,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:37,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:37,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:37,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:38,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:38,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:12:38,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:38,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:38,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:38,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:38,055 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:38,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:38,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:38,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:38,058 INFO L87 Difference]: Start difference. First operand 604 states and 919 transitions. Second operand 4 states. [2018-10-26 23:12:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:40,740 INFO L93 Difference]: Finished difference Result 1303 states and 1976 transitions. [2018-10-26 23:12:40,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:40,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-26 23:12:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:40,744 INFO L225 Difference]: With dead ends: 1303 [2018-10-26 23:12:40,744 INFO L226 Difference]: Without dead ends: 725 [2018-10-26 23:12:40,745 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-10-26 23:12:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-10-26 23:12:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 606. [2018-10-26 23:12:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-10-26 23:12:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 921 transitions. [2018-10-26 23:12:40,769 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 921 transitions. Word has length 94 [2018-10-26 23:12:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:40,770 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 921 transitions. [2018-10-26 23:12:40,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 921 transitions. [2018-10-26 23:12:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 23:12:40,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:40,771 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-10-26 23:12:40,771 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:40,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:40,771 INFO L82 PathProgramCache]: Analyzing trace with hash -527844273, now seen corresponding path program 1 times [2018-10-26 23:12:40,772 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:40,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:41,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:41,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:41,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:41,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:41,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:41,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:41,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:41,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:41,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:12:41,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:41,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:41,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:41,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:12:41,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:41,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:41,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:41,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:41,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:41,379 INFO L87 Difference]: Start difference. First operand 606 states and 921 transitions. Second operand 4 states. [2018-10-26 23:12:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:44,001 INFO L93 Difference]: Finished difference Result 1285 states and 1952 transitions. [2018-10-26 23:12:44,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:44,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-26 23:12:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:44,005 INFO L225 Difference]: With dead ends: 1285 [2018-10-26 23:12:44,005 INFO L226 Difference]: Without dead ends: 705 [2018-10-26 23:12:44,006 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-10-26 23:12:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-10-26 23:12:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 606. [2018-10-26 23:12:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-10-26 23:12:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 919 transitions. [2018-10-26 23:12:44,033 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 919 transitions. Word has length 95 [2018-10-26 23:12:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:44,033 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 919 transitions. [2018-10-26 23:12:44,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 919 transitions. [2018-10-26 23:12:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 23:12:44,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:44,034 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-10-26 23:12:44,035 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:44,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:44,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1921075204, now seen corresponding path program 1 times [2018-10-26 23:12:44,035 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:44,035 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:44,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:44,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:44,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:44,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:44,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:44,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:44,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:44,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:44,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:44,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:12:44,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:44,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:44,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:44,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:44,576 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:44,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:44,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:44,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:44,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:44,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:44,581 INFO L87 Difference]: Start difference. First operand 606 states and 919 transitions. Second operand 4 states. [2018-10-26 23:12:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:47,186 INFO L93 Difference]: Finished difference Result 1285 states and 1948 transitions. [2018-10-26 23:12:47,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:47,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-26 23:12:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:47,190 INFO L225 Difference]: With dead ends: 1285 [2018-10-26 23:12:47,190 INFO L226 Difference]: Without dead ends: 705 [2018-10-26 23:12:47,191 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-10-26 23:12:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-10-26 23:12:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 606. [2018-10-26 23:12:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-10-26 23:12:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 917 transitions. [2018-10-26 23:12:47,215 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 917 transitions. Word has length 95 [2018-10-26 23:12:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:47,216 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 917 transitions. [2018-10-26 23:12:47,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 917 transitions. [2018-10-26 23:12:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-26 23:12:47,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:47,217 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-10-26 23:12:47,217 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:47,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash 484346764, now seen corresponding path program 1 times [2018-10-26 23:12:47,218 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:47,218 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:47,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:47,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:47,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:47,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-10-26 23:12:47,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:47,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:47,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:47,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:47,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:47,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:12:47,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:47,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:47,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:47,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:47,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:47,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:47,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:47,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:47,788 INFO L87 Difference]: Start difference. First operand 606 states and 917 transitions. Second operand 4 states. [2018-10-26 23:12:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:50,321 INFO L93 Difference]: Finished difference Result 1281 states and 1940 transitions. [2018-10-26 23:12:50,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:50,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-26 23:12:50,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:50,326 INFO L225 Difference]: With dead ends: 1281 [2018-10-26 23:12:50,326 INFO L226 Difference]: Without dead ends: 701 [2018-10-26 23:12:50,327 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-10-26 23:12:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-26 23:12:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 608. [2018-10-26 23:12:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-26 23:12:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 919 transitions. [2018-10-26 23:12:50,359 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 919 transitions. Word has length 95 [2018-10-26 23:12:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:50,359 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 919 transitions. [2018-10-26 23:12:50,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 919 transitions. [2018-10-26 23:12:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 23:12:50,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:50,360 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-10-26 23:12:50,360 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:50,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:50,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2001401312, now seen corresponding path program 1 times [2018-10-26 23:12:50,361 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:50,361 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:50,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:50,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:50,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-10-26 23:12:50,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:50,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:50,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:50,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:50,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:50,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-10-26 23:12:50,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:50,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:50,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:50,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:50,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:50,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:50,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:50,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:50,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:50,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:50,885 INFO L87 Difference]: Start difference. First operand 608 states and 919 transitions. Second operand 4 states. [2018-10-26 23:12:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:53,535 INFO L93 Difference]: Finished difference Result 1279 states and 1934 transitions. [2018-10-26 23:12:53,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:53,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-10-26 23:12:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:53,538 INFO L225 Difference]: With dead ends: 1279 [2018-10-26 23:12:53,539 INFO L226 Difference]: Without dead ends: 697 [2018-10-26 23:12:53,540 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-10-26 23:12:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-10-26 23:12:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 608. [2018-10-26 23:12:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-26 23:12:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 917 transitions. [2018-10-26 23:12:53,571 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 917 transitions. Word has length 96 [2018-10-26 23:12:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:53,571 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 917 transitions. [2018-10-26 23:12:53,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 917 transitions. [2018-10-26 23:12:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 23:12:53,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:53,572 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-10-26 23:12:53,572 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:53,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1252892634, now seen corresponding path program 1 times [2018-10-26 23:12:53,573 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:53,573 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:53,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:54,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:54,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:12:54,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:12:54,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:54,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:54,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:54,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:12:54,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:12:54,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:12:54,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:54,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:54,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:54,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:12:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:12:54,152 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:54,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:54,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:12:54,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:12:54,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:12:54,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:12:54,155 INFO L87 Difference]: Start difference. First operand 608 states and 917 transitions. Second operand 4 states. [2018-10-26 23:12:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:12:56,770 INFO L93 Difference]: Finished difference Result 1273 states and 1922 transitions. [2018-10-26 23:12:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:12:56,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-10-26 23:12:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:12:56,774 INFO L225 Difference]: With dead ends: 1273 [2018-10-26 23:12:56,774 INFO L226 Difference]: Without dead ends: 691 [2018-10-26 23:12:56,775 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-10-26 23:12:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-10-26 23:12:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 610. [2018-10-26 23:12:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-26 23:12:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 919 transitions. [2018-10-26 23:12:56,799 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 919 transitions. Word has length 96 [2018-10-26 23:12:56,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:12:56,799 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 919 transitions. [2018-10-26 23:12:56,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:12:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 919 transitions. [2018-10-26 23:12:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-26 23:12:56,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:12:56,801 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-10-26 23:12:56,801 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:12:56,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:12:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 99074589, now seen corresponding path program 1 times [2018-10-26 23:12:56,802 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:12:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:12:56,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:12:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:12:57,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:12:57,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 18 treesize of output 15 [2018-10-26 23:12:57,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:12:57,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:12:57,833 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-10-26 23:12:57,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:57,841 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:57,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:57,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:57,854 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:12:57,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-10-26 23:12:57,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:12:57,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:12:57,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:57,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:12:57,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:12:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:12:57,887 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:12:57,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:12:57,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:12:57,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:12:57,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:12:57,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:12:57,891 INFO L87 Difference]: Start difference. First operand 610 states and 919 transitions. Second operand 7 states. [2018-10-26 23:13:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:00,697 INFO L93 Difference]: Finished difference Result 925 states and 1405 transitions. [2018-10-26 23:13:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:00,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-10-26 23:13:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:00,701 INFO L225 Difference]: With dead ends: 925 [2018-10-26 23:13:00,701 INFO L226 Difference]: Without dead ends: 618 [2018-10-26 23:13:00,701 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-10-26 23:13:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-26 23:13:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2018-10-26 23:13:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-26 23:13:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 918 transitions. [2018-10-26 23:13:00,728 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 918 transitions. Word has length 98 [2018-10-26 23:13:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:00,728 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 918 transitions. [2018-10-26 23:13:00,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 918 transitions. [2018-10-26 23:13:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-26 23:13:00,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:00,730 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-10-26 23:13:00,730 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:00,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:00,730 INFO L82 PathProgramCache]: Analyzing trace with hash 777839524, now seen corresponding path program 1 times [2018-10-26 23:13:00,730 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:00,730 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:01,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:01,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-10-26 23:13:01,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:01,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:01,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:01,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:01,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:01,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:01,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:01,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:01,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:01,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:01,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:01,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:01,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:01,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:01,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:01,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:01,227 INFO L87 Difference]: Start difference. First operand 610 states and 918 transitions. Second operand 4 states. [2018-10-26 23:13:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:03,905 INFO L93 Difference]: Finished difference Result 1275 states and 1920 transitions. [2018-10-26 23:13:03,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:13:03,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-10-26 23:13:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:03,910 INFO L225 Difference]: With dead ends: 1275 [2018-10-26 23:13:03,910 INFO L226 Difference]: Without dead ends: 691 [2018-10-26 23:13:03,911 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-10-26 23:13:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-10-26 23:13:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 612. [2018-10-26 23:13:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-26 23:13:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 920 transitions. [2018-10-26 23:13:03,941 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 920 transitions. Word has length 99 [2018-10-26 23:13:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:03,941 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 920 transitions. [2018-10-26 23:13:03,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:13:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 920 transitions. [2018-10-26 23:13:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 23:13:03,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:03,942 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-10-26 23:13:03,942 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:03,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:03,943 INFO L82 PathProgramCache]: Analyzing trace with hash 826591611, now seen corresponding path program 1 times [2018-10-26 23:13:03,943 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:03,943 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:03,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:04,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:04,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:04,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:04,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:04,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:04,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:04,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:04,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:04,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:04,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:04,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:04,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:04,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:04,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:04,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:04,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:04,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:04,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:04,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:04,571 INFO L87 Difference]: Start difference. First operand 612 states and 920 transitions. Second operand 4 states. [2018-10-26 23:13:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:07,146 INFO L93 Difference]: Finished difference Result 1265 states and 1904 transitions. [2018-10-26 23:13:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:13:07,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-26 23:13:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:07,150 INFO L225 Difference]: With dead ends: 1265 [2018-10-26 23:13:07,150 INFO L226 Difference]: Without dead ends: 679 [2018-10-26 23:13:07,151 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-10-26 23:13:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-10-26 23:13:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 614. [2018-10-26 23:13:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-10-26 23:13:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 922 transitions. [2018-10-26 23:13:07,179 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 922 transitions. Word has length 100 [2018-10-26 23:13:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:07,179 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 922 transitions. [2018-10-26 23:13:07,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:13:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 922 transitions. [2018-10-26 23:13:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 23:13:07,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:07,181 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-10-26 23:13:07,181 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:07,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 777786042, now seen corresponding path program 1 times [2018-10-26 23:13:07,181 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:07,182 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:07,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:07,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:07,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:07,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:07,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:07,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:07,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:07,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:07,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:07,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:07,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:07,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:07,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:07,727 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:07,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:07,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:07,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:07,731 INFO L87 Difference]: Start difference. First operand 614 states and 922 transitions. Second operand 4 states. [2018-10-26 23:13:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:10,302 INFO L93 Difference]: Finished difference Result 1267 states and 1904 transitions. [2018-10-26 23:13:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:13:10,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-26 23:13:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:10,306 INFO L225 Difference]: With dead ends: 1267 [2018-10-26 23:13:10,306 INFO L226 Difference]: Without dead ends: 679 [2018-10-26 23:13:10,307 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-10-26 23:13:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-10-26 23:13:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 616. [2018-10-26 23:13:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-10-26 23:13:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 924 transitions. [2018-10-26 23:13:10,332 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 924 transitions. Word has length 100 [2018-10-26 23:13:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:10,332 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 924 transitions. [2018-10-26 23:13:10,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:13:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 924 transitions. [2018-10-26 23:13:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-26 23:13:10,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:10,333 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-10-26 23:13:10,333 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:10,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash 753563747, now seen corresponding path program 1 times [2018-10-26 23:13:10,334 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:10,334 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:10,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:11,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:11,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:11,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:11,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:11,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:11,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:11,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:11,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:13:11,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:11,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:11,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:11,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:11,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:11,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:11,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:11,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:11,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:11,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:11,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:11,124 INFO L87 Difference]: Start difference. First operand 616 states and 924 transitions. Second operand 4 states. [2018-10-26 23:13:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:13,632 INFO L93 Difference]: Finished difference Result 1263 states and 1897 transitions. [2018-10-26 23:13:13,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:13:13,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-10-26 23:13:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:13,636 INFO L225 Difference]: With dead ends: 1263 [2018-10-26 23:13:13,636 INFO L226 Difference]: Without dead ends: 673 [2018-10-26 23:13:13,637 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-10-26 23:13:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-26 23:13:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 618. [2018-10-26 23:13:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-26 23:13:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 926 transitions. [2018-10-26 23:13:13,662 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 926 transitions. Word has length 101 [2018-10-26 23:13:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:13,662 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 926 transitions. [2018-10-26 23:13:13,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:13:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 926 transitions. [2018-10-26 23:13:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 23:13:13,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:13,663 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-10-26 23:13:13,663 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:13,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:13,663 INFO L82 PathProgramCache]: Analyzing trace with hash -272351086, now seen corresponding path program 1 times [2018-10-26 23:13:13,664 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:13,664 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:13,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:14,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:14,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:14,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:14,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:14,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:14,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:14,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:14,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:13:14,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:14,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:14,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:14,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:14,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:14,257 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:14,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:14,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:14,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:14,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:14,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:14,261 INFO L87 Difference]: Start difference. First operand 618 states and 926 transitions. Second operand 4 states. [2018-10-26 23:13:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:16,821 INFO L93 Difference]: Finished difference Result 1265 states and 1897 transitions. [2018-10-26 23:13:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:13:16,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-26 23:13:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:16,826 INFO L225 Difference]: With dead ends: 1265 [2018-10-26 23:13:16,826 INFO L226 Difference]: Without dead ends: 673 [2018-10-26 23:13:16,827 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-10-26 23:13:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-26 23:13:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 620. [2018-10-26 23:13:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-26 23:13:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 928 transitions. [2018-10-26 23:13:16,857 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 928 transitions. Word has length 102 [2018-10-26 23:13:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:16,858 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 928 transitions. [2018-10-26 23:13:16,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:13:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 928 transitions. [2018-10-26 23:13:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 23:13:16,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:16,859 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-10-26 23:13:16,859 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:16,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 684290203, now seen corresponding path program 1 times [2018-10-26 23:13:16,860 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:16,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:17,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:17,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-10-26 23:13:17,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:13:17,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:17,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:17,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:17,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:17,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:13:17,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:17,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:17,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:17,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:17,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:17,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:17,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:17,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:17,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:17,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:17,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:17,477 INFO L87 Difference]: Start difference. First operand 620 states and 928 transitions. Second operand 4 states. [2018-10-26 23:13:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:20,060 INFO L93 Difference]: Finished difference Result 1261 states and 1890 transitions. [2018-10-26 23:13:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:13:20,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-10-26 23:13:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:20,064 INFO L225 Difference]: With dead ends: 1261 [2018-10-26 23:13:20,064 INFO L226 Difference]: Without dead ends: 667 [2018-10-26 23:13:20,065 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-10-26 23:13:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-26 23:13:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 622. [2018-10-26 23:13:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-26 23:13:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 930 transitions. [2018-10-26 23:13:20,092 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 930 transitions. Word has length 103 [2018-10-26 23:13:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:20,093 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 930 transitions. [2018-10-26 23:13:20,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:13:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 930 transitions. [2018-10-26 23:13:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 23:13:20,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:20,094 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-10-26 23:13:20,094 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:20,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1978832885, now seen corresponding path program 1 times [2018-10-26 23:13:20,095 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:20,095 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:20,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:21,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:21,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:13:21,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:21,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:13:21,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:13:21,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:13:21,320 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-10-26 23:13:21,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:13:21,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:21,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:13:21,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:21,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:13:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:13:21,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:21,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:21,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:13:21,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:13:21,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:13:21,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:13:21,365 INFO L87 Difference]: Start difference. First operand 622 states and 930 transitions. Second operand 7 states. [2018-10-26 23:13:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:22,418 INFO L93 Difference]: Finished difference Result 1375 states and 2038 transitions. [2018-10-26 23:13:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:22,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-10-26 23:13:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:22,422 INFO L225 Difference]: With dead ends: 1375 [2018-10-26 23:13:22,422 INFO L226 Difference]: Without dead ends: 779 [2018-10-26 23:13:22,423 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-10-26 23:13:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-26 23:13:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 622. [2018-10-26 23:13:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-26 23:13:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 928 transitions. [2018-10-26 23:13:22,453 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 928 transitions. Word has length 108 [2018-10-26 23:13:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:22,454 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 928 transitions. [2018-10-26 23:13:22,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 928 transitions. [2018-10-26 23:13:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 23:13:22,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:22,455 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-10-26 23:13:22,455 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:22,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1755434633, now seen corresponding path program 1 times [2018-10-26 23:13:22,456 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:22,456 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:22,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:23,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:23,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:13:23,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:13:23,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:13:23,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:23,737 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:13:23,739 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-10-26 23:13:23,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:13:23,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:23,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:23,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:23,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:13:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:13:23,777 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:23,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:23,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:13:23,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:13:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:13:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:13:23,782 INFO L87 Difference]: Start difference. First operand 622 states and 928 transitions. Second operand 7 states. [2018-10-26 23:13:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:26,866 INFO L93 Difference]: Finished difference Result 1283 states and 1908 transitions. [2018-10-26 23:13:26,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:26,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-10-26 23:13:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:26,870 INFO L225 Difference]: With dead ends: 1283 [2018-10-26 23:13:26,871 INFO L226 Difference]: Without dead ends: 687 [2018-10-26 23:13:26,875 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-10-26 23:13:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-26 23:13:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 622. [2018-10-26 23:13:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-26 23:13:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 926 transitions. [2018-10-26 23:13:26,905 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 926 transitions. Word has length 108 [2018-10-26 23:13:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:26,905 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 926 transitions. [2018-10-26 23:13:26,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 926 transitions. [2018-10-26 23:13:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 23:13:26,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:26,907 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-10-26 23:13:26,907 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:26,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1932711937, now seen corresponding path program 1 times [2018-10-26 23:13:26,908 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:26,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:28,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:28,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:13:28,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-10-26 23:13:28,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:13:28,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:28,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:13:28,177 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-10-26 23:13:28,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:13:28,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:28,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:28,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:28,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:13:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:13:28,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:28,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:28,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:13:28,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:13:28,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:13:28,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:13:28,248 INFO L87 Difference]: Start difference. First operand 622 states and 926 transitions. Second operand 7 states. [2018-10-26 23:13:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:31,515 INFO L93 Difference]: Finished difference Result 1375 states and 2030 transitions. [2018-10-26 23:13:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:31,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-10-26 23:13:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:31,519 INFO L225 Difference]: With dead ends: 1375 [2018-10-26 23:13:31,519 INFO L226 Difference]: Without dead ends: 779 [2018-10-26 23:13:31,520 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-10-26 23:13:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-26 23:13:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 622. [2018-10-26 23:13:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-26 23:13:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2018-10-26 23:13:31,550 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 109 [2018-10-26 23:13:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:31,550 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2018-10-26 23:13:31,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2018-10-26 23:13:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 23:13:31,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:31,552 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-10-26 23:13:31,552 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:31,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1730888003, now seen corresponding path program 1 times [2018-10-26 23:13:31,552 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:31,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:31,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:32,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:32,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:13:32,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:13:32,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:13:32,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:13:32,820 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:13:32,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:13:32,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:13:32,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:32,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:32,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:32,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:13:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:13:32,865 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:32,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:32,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:13:32,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:13:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:13:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:13:32,870 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 7 states. [2018-10-26 23:13:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:33,890 INFO L93 Difference]: Finished difference Result 1283 states and 1900 transitions. [2018-10-26 23:13:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:33,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-10-26 23:13:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:33,894 INFO L225 Difference]: With dead ends: 1283 [2018-10-26 23:13:33,894 INFO L226 Difference]: Without dead ends: 687 [2018-10-26 23:13:33,895 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-10-26 23:13:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-26 23:13:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 622. [2018-10-26 23:13:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-26 23:13:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 922 transitions. [2018-10-26 23:13:33,935 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 922 transitions. Word has length 109 [2018-10-26 23:13:33,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:33,935 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 922 transitions. [2018-10-26 23:13:33,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 922 transitions. [2018-10-26 23:13:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 23:13:33,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:33,936 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-10-26 23:13:33,936 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:33,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 160749520, now seen corresponding path program 1 times [2018-10-26 23:13:33,937 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:33,937 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:33,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:35,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:35,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-10-26 23:13:35,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:35,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:13:35,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 23 treesize of output 18 [2018-10-26 23:13:35,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:13:35,144 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-10-26 23:13:35,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:13:35,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:13:35,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:13:35,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:35,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:13:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:13:35,189 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:35,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:35,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:13:35,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:13:35,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:13:35,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:13:35,194 INFO L87 Difference]: Start difference. First operand 622 states and 922 transitions. Second operand 7 states. [2018-10-26 23:13:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:38,395 INFO L93 Difference]: Finished difference Result 1375 states and 2022 transitions. [2018-10-26 23:13:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:38,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-10-26 23:13:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:38,401 INFO L225 Difference]: With dead ends: 1375 [2018-10-26 23:13:38,401 INFO L226 Difference]: Without dead ends: 779 [2018-10-26 23:13:38,402 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-10-26 23:13:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-26 23:13:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 622. [2018-10-26 23:13:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-26 23:13:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 920 transitions. [2018-10-26 23:13:38,444 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 920 transitions. Word has length 110 [2018-10-26 23:13:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:38,444 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 920 transitions. [2018-10-26 23:13:38,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 920 transitions. [2018-10-26 23:13:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 23:13:38,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:38,446 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-10-26 23:13:38,446 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:38,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:38,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2122324178, now seen corresponding path program 1 times [2018-10-26 23:13:38,447 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:38,447 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:38,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:39,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:39,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:39,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:13:39,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:13:39,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:39,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:13:39,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-10-26 23:13:39,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:13:39,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:39,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:39,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:39,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:13:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:13:39,918 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:39,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:39,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:13:39,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:13:39,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:13:39,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:13:39,923 INFO L87 Difference]: Start difference. First operand 622 states and 920 transitions. Second operand 7 states. [2018-10-26 23:13:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:43,031 INFO L93 Difference]: Finished difference Result 1283 states and 1892 transitions. [2018-10-26 23:13:43,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:43,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-10-26 23:13:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:43,035 INFO L225 Difference]: With dead ends: 1283 [2018-10-26 23:13:43,036 INFO L226 Difference]: Without dead ends: 687 [2018-10-26 23:13:43,037 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-10-26 23:13:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-26 23:13:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 622. [2018-10-26 23:13:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-26 23:13:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 918 transitions. [2018-10-26 23:13:43,077 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 918 transitions. Word has length 110 [2018-10-26 23:13:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:43,077 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 918 transitions. [2018-10-26 23:13:43,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 918 transitions. [2018-10-26 23:13:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 23:13:43,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:43,079 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-10-26 23:13:43,079 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:43,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1382764740, now seen corresponding path program 1 times [2018-10-26 23:13:43,080 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:43,080 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:43,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:43,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:43,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:13:43,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:43,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:43,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:43,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:43,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:43,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:43,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:43,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:43,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-10-26 23:13:43,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:43,805 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:43,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:43,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:43,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:43,809 INFO L87 Difference]: Start difference. First operand 622 states and 918 transitions. Second operand 4 states. [2018-10-26 23:13:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:46,363 INFO L93 Difference]: Finished difference Result 1263 states and 1866 transitions. [2018-10-26 23:13:46,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:13:46,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-10-26 23:13:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:46,366 INFO L225 Difference]: With dead ends: 1263 [2018-10-26 23:13:46,366 INFO L226 Difference]: Without dead ends: 667 [2018-10-26 23:13:46,367 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-10-26 23:13:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-26 23:13:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 628. [2018-10-26 23:13:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-26 23:13:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 924 transitions. [2018-10-26 23:13:46,397 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 924 transitions. Word has length 111 [2018-10-26 23:13:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:46,397 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 924 transitions. [2018-10-26 23:13:46,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:13:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 924 transitions. [2018-10-26 23:13:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 23:13:46,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:46,398 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-10-26 23:13:46,398 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:46,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:46,399 INFO L82 PathProgramCache]: Analyzing trace with hash -569155398, now seen corresponding path program 1 times [2018-10-26 23:13:46,399 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:46,399 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:46,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:47,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:47,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:47,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:47,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:13:47,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-10-26 23:13:47,714 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:13:47,715 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-10-26 23:13:47,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:13:47,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:13:47,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:47,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:47,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:13:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:13:47,763 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:47,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:47,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:13:47,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:13:47,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:13:47,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:13:47,767 INFO L87 Difference]: Start difference. First operand 628 states and 924 transitions. Second operand 7 states. [2018-10-26 23:13:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:50,979 INFO L93 Difference]: Finished difference Result 1363 states and 1996 transitions. [2018-10-26 23:13:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:50,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-10-26 23:13:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:50,982 INFO L225 Difference]: With dead ends: 1363 [2018-10-26 23:13:50,982 INFO L226 Difference]: Without dead ends: 761 [2018-10-26 23:13:50,983 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-10-26 23:13:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-10-26 23:13:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 628. [2018-10-26 23:13:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-26 23:13:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 922 transitions. [2018-10-26 23:13:51,023 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 922 transitions. Word has length 111 [2018-10-26 23:13:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:51,024 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 922 transitions. [2018-10-26 23:13:51,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 922 transitions. [2018-10-26 23:13:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 23:13:51,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:51,025 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-10-26 23:13:51,025 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:51,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:51,026 INFO L82 PathProgramCache]: Analyzing trace with hash 110116856, now seen corresponding path program 1 times [2018-10-26 23:13:51,026 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:51,026 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:51,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:52,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:52,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 13 treesize of output 10 [2018-10-26 23:13:52,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:52,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:13:52,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:52,493 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:13:52,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-10-26 23:13:52,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:13:52,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:13:52,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:13:52,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:52,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:13:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:13:52,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:52,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:52,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:13:52,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:13:52,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:13:52,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:13:52,551 INFO L87 Difference]: Start difference. First operand 628 states and 922 transitions. Second operand 7 states. [2018-10-26 23:13:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:53,685 INFO L93 Difference]: Finished difference Result 1275 states and 1870 transitions. [2018-10-26 23:13:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:13:53,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-10-26 23:13:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:53,689 INFO L225 Difference]: With dead ends: 1275 [2018-10-26 23:13:53,689 INFO L226 Difference]: Without dead ends: 673 [2018-10-26 23:13:53,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:13:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-26 23:13:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 628. [2018-10-26 23:13:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-26 23:13:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 920 transitions. [2018-10-26 23:13:53,736 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 920 transitions. Word has length 111 [2018-10-26 23:13:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:53,736 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 920 transitions. [2018-10-26 23:13:53,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:13:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 920 transitions. [2018-10-26 23:13:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 23:13:53,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:53,737 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-10-26 23:13:53,737 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:53,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2084137371, now seen corresponding path program 1 times [2018-10-26 23:13:53,738 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:53,738 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:53,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:54,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:54,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:54,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:54,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:54,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:54,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:54,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:54,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:54,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:13:54,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:54,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:54,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-10-26 23:13:54,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:54,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:54,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:54,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:54,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:54,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:54,411 INFO L87 Difference]: Start difference. First operand 628 states and 920 transitions. Second operand 4 states. [2018-10-26 23:13:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:13:56,964 INFO L93 Difference]: Finished difference Result 1255 states and 1844 transitions. [2018-10-26 23:13:56,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:13:56,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-10-26 23:13:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:13:56,968 INFO L225 Difference]: With dead ends: 1255 [2018-10-26 23:13:56,968 INFO L226 Difference]: Without dead ends: 653 [2018-10-26 23:13:56,969 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-10-26 23:13:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-26 23:13:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 630. [2018-10-26 23:13:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-10-26 23:13:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 922 transitions. [2018-10-26 23:13:56,999 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 922 transitions. Word has length 112 [2018-10-26 23:13:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:13:56,999 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 922 transitions. [2018-10-26 23:13:56,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:13:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 922 transitions. [2018-10-26 23:13:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-26 23:13:57,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:13:57,000 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-10-26 23:13:57,000 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:13:57,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:13:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1530199105, now seen corresponding path program 1 times [2018-10-26 23:13:57,001 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:13:57,001 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:13:57,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:13:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:13:57,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:13:57,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:13:57,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:13:57,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:57,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:57,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:57,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:13:57,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:13:57,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-10-26 23:13:57,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:13:57,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:57,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:13:57,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:13:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:13:57,595 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:13:57,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:13:57,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:13:57,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:13:57,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:13:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:13:57,604 INFO L87 Difference]: Start difference. First operand 630 states and 922 transitions. Second operand 4 states. [2018-10-26 23:14:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:00,047 INFO L93 Difference]: Finished difference Result 1257 states and 1844 transitions. [2018-10-26 23:14:00,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:14:00,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-10-26 23:14:00,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:00,049 INFO L225 Difference]: With dead ends: 1257 [2018-10-26 23:14:00,049 INFO L226 Difference]: Without dead ends: 653 [2018-10-26 23:14:00,050 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-10-26 23:14:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-26 23:14:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 632. [2018-10-26 23:14:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-10-26 23:14:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 924 transitions. [2018-10-26 23:14:00,096 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 924 transitions. Word has length 113 [2018-10-26 23:14:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:00,096 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 924 transitions. [2018-10-26 23:14:00,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:14:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 924 transitions. [2018-10-26 23:14:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-26 23:14:00,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:00,097 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-10-26 23:14:00,098 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:00,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1652681162, now seen corresponding path program 1 times [2018-10-26 23:14:00,098 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:00,099 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:00,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:00,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:00,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:14:00,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-10-26 23:14:00,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:00,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:00,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:00,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:14:00,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-10-26 23:14:00,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-10-26 23:14:00,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:00,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:00,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:00,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:14:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:14:00,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:00,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:00,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:14:00,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:14:00,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:14:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:14:00,676 INFO L87 Difference]: Start difference. First operand 632 states and 924 transitions. Second operand 4 states. [2018-10-26 23:14:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:03,119 INFO L93 Difference]: Finished difference Result 1006 states and 1467 transitions. [2018-10-26 23:14:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:14:03,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-10-26 23:14:03,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:03,122 INFO L225 Difference]: With dead ends: 1006 [2018-10-26 23:14:03,123 INFO L226 Difference]: Without dead ends: 354 [2018-10-26 23:14:03,123 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-10-26 23:14:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-26 23:14:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 347. [2018-10-26 23:14:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-26 23:14:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 517 transitions. [2018-10-26 23:14:03,141 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 517 transitions. Word has length 114 [2018-10-26 23:14:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:03,142 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 517 transitions. [2018-10-26 23:14:03,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:14:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 517 transitions. [2018-10-26 23:14:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 23:14:03,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:03,143 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-10-26 23:14:03,143 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:03,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash 483953184, now seen corresponding path program 1 times [2018-10-26 23:14:03,143 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:03,144 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:03,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:04,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:04,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:04,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:14:04,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:04,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:14:04,308 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:04,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-10-26 23:14:04,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:04,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:04,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:04,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:04,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:04,347 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:04,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:04,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:04,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:04,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:04,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:04,352 INFO L87 Difference]: Start difference. First operand 347 states and 517 transitions. Second operand 7 states. [2018-10-26 23:14:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:07,217 INFO L93 Difference]: Finished difference Result 710 states and 1068 transitions. [2018-10-26 23:14:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:07,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-10-26 23:14:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:07,220 INFO L225 Difference]: With dead ends: 710 [2018-10-26 23:14:07,220 INFO L226 Difference]: Without dead ends: 414 [2018-10-26 23:14:07,220 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-10-26 23:14:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-26 23:14:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 347. [2018-10-26 23:14:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-26 23:14:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 516 transitions. [2018-10-26 23:14:07,239 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 516 transitions. Word has length 115 [2018-10-26 23:14:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:07,239 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 516 transitions. [2018-10-26 23:14:07,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 516 transitions. [2018-10-26 23:14:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 23:14:07,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:07,240 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-10-26 23:14:07,240 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:07,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -248014242, now seen corresponding path program 1 times [2018-10-26 23:14:07,241 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:07,241 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:07,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:08,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:08,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14: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-10-26 23:14:08,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:08,326 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-10-26 23:14:08,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:08,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:08,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:08,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:08,345 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:14:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:14:08,379 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:08,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:08,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:08,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:08,384 INFO L87 Difference]: Start difference. First operand 347 states and 516 transitions. Second operand 7 states. [2018-10-26 23:14:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:09,146 INFO L93 Difference]: Finished difference Result 705 states and 1061 transitions. [2018-10-26 23:14:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:09,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-10-26 23:14:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:09,165 INFO L225 Difference]: With dead ends: 705 [2018-10-26 23:14:09,165 INFO L226 Difference]: Without dead ends: 409 [2018-10-26 23:14:09,165 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-10-26 23:14:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-26 23:14:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 374. [2018-10-26 23:14:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-26 23:14:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 561 transitions. [2018-10-26 23:14:09,202 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 561 transitions. Word has length 115 [2018-10-26 23:14:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:09,203 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 561 transitions. [2018-10-26 23:14:09,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 561 transitions. [2018-10-26 23:14:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 23:14:09,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:09,204 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-10-26 23:14:09,204 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:09,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash 714404085, now seen corresponding path program 1 times [2018-10-26 23:14:09,205 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:09,205 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:09,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:09,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:09,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:09,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-10-26 23:14:09,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:09,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:09,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:09,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:14:09,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:14:09,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-10-26 23:14:09,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:09,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:09,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:09,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:14:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:14:09,889 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:09,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:14:09,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:14:09,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:14:09,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:14:09,894 INFO L87 Difference]: Start difference. First operand 374 states and 561 transitions. Second operand 4 states. [2018-10-26 23:14:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:12,488 INFO L93 Difference]: Finished difference Result 773 states and 1174 transitions. [2018-10-26 23:14:12,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:14:12,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-10-26 23:14:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:12,492 INFO L225 Difference]: With dead ends: 773 [2018-10-26 23:14:12,492 INFO L226 Difference]: Without dead ends: 450 [2018-10-26 23:14:12,492 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-10-26 23:14:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-26 23:14:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2018-10-26 23:14:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-26 23:14:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 614 transitions. [2018-10-26 23:14:12,512 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 614 transitions. Word has length 118 [2018-10-26 23:14:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:12,512 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 614 transitions. [2018-10-26 23:14:12,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:14:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 614 transitions. [2018-10-26 23:14:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:14:12,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:12,513 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-10-26 23:14:12,513 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:12,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1229590027, now seen corresponding path program 1 times [2018-10-26 23:14:12,514 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:12,514 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:12,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:13,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:13,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:14:13,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:14:13,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:13,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 23 treesize of output 18 [2018-10-26 23:14:13,811 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:13,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:14:13,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:13,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:13,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:13,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:13,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:13,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:13,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:13,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:13,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:13,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:13,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:13,864 INFO L87 Difference]: Start difference. First operand 405 states and 614 transitions. Second operand 7 states. [2018-10-26 23:14:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:16,887 INFO L93 Difference]: Finished difference Result 826 states and 1262 transitions. [2018-10-26 23:14:16,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:16,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-10-26 23:14:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:16,889 INFO L225 Difference]: With dead ends: 826 [2018-10-26 23:14:16,889 INFO L226 Difference]: Without dead ends: 472 [2018-10-26 23:14:16,890 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-10-26 23:14:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-26 23:14:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 405. [2018-10-26 23:14:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-26 23:14:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 613 transitions. [2018-10-26 23:14:16,944 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 613 transitions. Word has length 120 [2018-10-26 23:14:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:16,945 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 613 transitions. [2018-10-26 23:14:16,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 613 transitions. [2018-10-26 23:14:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:14:16,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:16,953 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-10-26 23:14:16,953 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:16,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1757787614, now seen corresponding path program 1 times [2018-10-26 23:14:16,954 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:16,954 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:16,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:18,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:18,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:18,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:14:18,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:18,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:18,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:18,357 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-10-26 23:14:18,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:18,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:18,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:18,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:18,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:14:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:14:18,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:18,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:18,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:18,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:18,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:18,412 INFO L87 Difference]: Start difference. First operand 405 states and 613 transitions. Second operand 7 states. [2018-10-26 23:14:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:21,458 INFO L93 Difference]: Finished difference Result 816 states and 1248 transitions. [2018-10-26 23:14:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:21,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-10-26 23:14:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:21,461 INFO L225 Difference]: With dead ends: 816 [2018-10-26 23:14:21,461 INFO L226 Difference]: Without dead ends: 462 [2018-10-26 23:14:21,462 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-10-26 23:14:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-10-26 23:14:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 405. [2018-10-26 23:14:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-26 23:14:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 612 transitions. [2018-10-26 23:14:21,486 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 612 transitions. Word has length 121 [2018-10-26 23:14:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:21,486 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 612 transitions. [2018-10-26 23:14:21,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 612 transitions. [2018-10-26 23:14:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:14:21,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:21,488 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-10-26 23:14:21,488 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:21,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash 691131863, now seen corresponding path program 1 times [2018-10-26 23:14:21,489 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:21,489 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:21,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:22,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:22,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 13 treesize of output 10 [2018-10-26 23:14:22,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:14:22,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:22,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:22,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:22,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:22,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 23 treesize of output 18 [2018-10-26 23:14:22,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:22,803 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-10-26 23:14:22,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:22,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:22,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:22,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:22,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:22,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:22,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:22,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:22,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-10-26 23:14:22,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:22,843 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:22,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:22,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:22,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:22,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:22,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:22,850 INFO L87 Difference]: Start difference. First operand 405 states and 612 transitions. Second operand 7 states. [2018-10-26 23:14:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:23,826 INFO L93 Difference]: Finished difference Result 816 states and 1246 transitions. [2018-10-26 23:14:23,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:23,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-10-26 23:14:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:23,829 INFO L225 Difference]: With dead ends: 816 [2018-10-26 23:14:23,829 INFO L226 Difference]: Without dead ends: 462 [2018-10-26 23:14:23,830 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-10-26 23:14:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-10-26 23:14:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 405. [2018-10-26 23:14:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-26 23:14:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 611 transitions. [2018-10-26 23:14:23,852 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 611 transitions. Word has length 121 [2018-10-26 23:14:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:23,853 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 611 transitions. [2018-10-26 23:14:23,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 611 transitions. [2018-10-26 23:14:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:14:23,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:23,854 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-10-26 23:14:23,854 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:23,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:23,854 INFO L82 PathProgramCache]: Analyzing trace with hash -745596577, now seen corresponding path program 1 times [2018-10-26 23:14:23,855 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:23,855 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:23,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:25,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:25,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:14:25,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:14:25,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:25,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:25,260 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:25,262 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-10-26 23:14:25,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:25,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:25,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:25,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:25,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:25,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:25,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:25,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:25,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:25,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:25,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:25,319 INFO L87 Difference]: Start difference. First operand 405 states and 611 transitions. Second operand 7 states. [2018-10-26 23:14:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:28,355 INFO L93 Difference]: Finished difference Result 814 states and 1242 transitions. [2018-10-26 23:14:28,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:28,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-10-26 23:14:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:28,359 INFO L225 Difference]: With dead ends: 814 [2018-10-26 23:14:28,359 INFO L226 Difference]: Without dead ends: 460 [2018-10-26 23:14:28,360 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-10-26 23:14:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-26 23:14:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 405. [2018-10-26 23:14:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-26 23:14:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 610 transitions. [2018-10-26 23:14:28,382 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 610 transitions. Word has length 121 [2018-10-26 23:14:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:28,383 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 610 transitions. [2018-10-26 23:14:28,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 610 transitions. [2018-10-26 23:14:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:14:28,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:28,384 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-10-26 23:14:28,384 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1680886816, now seen corresponding path program 1 times [2018-10-26 23:14:28,385 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:28,385 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:28,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:29,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:29,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:29,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, 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-10-26 23:14:29,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:29,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:29,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:29,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:29,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:29,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:29,932 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-10-26 23:14:29,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:29,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:29,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:29,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:29,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:30,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:14:30,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:30,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:30,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:30,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:14:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:14:30,315 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (69)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 23:14:30,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:30,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:30,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:30,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:30,325 INFO L87 Difference]: Start difference. First operand 405 states and 610 transitions. Second operand 7 states. [2018-10-26 23:14:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:33,256 INFO L93 Difference]: Finished difference Result 772 states and 1175 transitions. [2018-10-26 23:14:33,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:33,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-10-26 23:14:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:33,260 INFO L225 Difference]: With dead ends: 772 [2018-10-26 23:14:33,260 INFO L226 Difference]: Without dead ends: 418 [2018-10-26 23:14:33,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:14:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-26 23:14:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 405. [2018-10-26 23:14:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-26 23:14:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 609 transitions. [2018-10-26 23:14:33,286 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 609 transitions. Word has length 121 [2018-10-26 23:14:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:33,286 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 609 transitions. [2018-10-26 23:14:33,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2018-10-26 23:14:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 23:14:33,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:33,287 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-10-26 23:14:33,287 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:33,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:33,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1767103891, now seen corresponding path program 1 times [2018-10-26 23:14:33,288 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:33,288 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:33,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:34,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:34,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 13 treesize of output 10 [2018-10-26 23:14:34,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:14:34,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:34,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:34,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:34,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:34,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:14:34,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:34,829 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-10-26 23:14:34,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:34,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:34,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:34,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:34,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:34,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:34,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:34,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:34,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-10-26 23:14:34,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:34,871 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:34,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:34,876 INFO L87 Difference]: Start difference. First operand 405 states and 609 transitions. Second operand 7 states. [2018-10-26 23:14:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:37,941 INFO L93 Difference]: Finished difference Result 812 states and 1235 transitions. [2018-10-26 23:14:37,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:37,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-10-26 23:14:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:37,945 INFO L225 Difference]: With dead ends: 812 [2018-10-26 23:14:37,945 INFO L226 Difference]: Without dead ends: 458 [2018-10-26 23:14:37,946 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-10-26 23:14:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-26 23:14:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 405. [2018-10-26 23:14:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-26 23:14:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 608 transitions. [2018-10-26 23:14:37,973 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 608 transitions. Word has length 122 [2018-10-26 23:14:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:37,973 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 608 transitions. [2018-10-26 23:14:37,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 608 transitions. [2018-10-26 23:14:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 23:14:37,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:37,974 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-10-26 23:14:37,975 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:37,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash -726430541, now seen corresponding path program 1 times [2018-10-26 23:14:37,978 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:37,978 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:38,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:39,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:39,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:14:39,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:14:39,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:39,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:39,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:39,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:14:39,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:39,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 23:14:39,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 23:14:39,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:39,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:39,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:39,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:39,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:39,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:39,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:39,477 INFO L87 Difference]: Start difference. First operand 405 states and 608 transitions. Second operand 7 states. [2018-10-26 23:14:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:42,478 INFO L93 Difference]: Finished difference Result 809 states and 1229 transitions. [2018-10-26 23:14:42,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:42,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-10-26 23:14:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:42,481 INFO L225 Difference]: With dead ends: 809 [2018-10-26 23:14:42,481 INFO L226 Difference]: Without dead ends: 455 [2018-10-26 23:14:42,482 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-10-26 23:14:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-26 23:14:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 405. [2018-10-26 23:14:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-26 23:14:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 607 transitions. [2018-10-26 23:14:42,520 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 607 transitions. Word has length 122 [2018-10-26 23:14:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:42,520 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 607 transitions. [2018-10-26 23:14:42,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 607 transitions. [2018-10-26 23:14:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:14:42,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:42,521 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-10-26 23:14:42,522 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:42,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:42,522 INFO L82 PathProgramCache]: Analyzing trace with hash -531411824, now seen corresponding path program 1 times [2018-10-26 23:14:42,522 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:42,522 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:42,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:42,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:42,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:42,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:42,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:14:42,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:14:42,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:14:42,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:14:42,770 INFO L87 Difference]: Start difference. First operand 405 states and 607 transitions. Second operand 3 states. [2018-10-26 23:14:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:42,888 INFO L93 Difference]: Finished difference Result 1108 states and 1689 transitions. [2018-10-26 23:14:42,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:14:42,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-10-26 23:14:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:42,892 INFO L225 Difference]: With dead ends: 1108 [2018-10-26 23:14:42,893 INFO L226 Difference]: Without dead ends: 754 [2018-10-26 23:14:42,893 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-10-26 23:14:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-26 23:14:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2018-10-26 23:14:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-26 23:14:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1123 transitions. [2018-10-26 23:14:42,935 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1123 transitions. Word has length 124 [2018-10-26 23:14:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:42,936 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1123 transitions. [2018-10-26 23:14:42,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:14:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1123 transitions. [2018-10-26 23:14:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 23:14:42,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:42,937 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-10-26 23:14:42,937 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:42,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:42,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1428805102, now seen corresponding path program 1 times [2018-10-26 23:14:42,938 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:42,938 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:42,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:44,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:44,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:44,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:14:44,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:44,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:44,457 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:44,459 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-10-26 23:14:44,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:44,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:44,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:44,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:44,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:44,515 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:44,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:44,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:44,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:44,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:44,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:44,519 INFO L87 Difference]: Start difference. First operand 752 states and 1123 transitions. Second operand 7 states. [2018-10-26 23:14:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:45,544 INFO L93 Difference]: Finished difference Result 1552 states and 2319 transitions. [2018-10-26 23:14:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:45,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-10-26 23:14:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:45,548 INFO L225 Difference]: With dead ends: 1552 [2018-10-26 23:14:45,548 INFO L226 Difference]: Without dead ends: 851 [2018-10-26 23:14:45,550 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-10-26 23:14:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-26 23:14:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 752. [2018-10-26 23:14:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-26 23:14:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1121 transitions. [2018-10-26 23:14:45,622 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1121 transitions. Word has length 124 [2018-10-26 23:14:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:45,622 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1121 transitions. [2018-10-26 23:14:45,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1121 transitions. [2018-10-26 23:14:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:14:45,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:45,632 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-10-26 23:14:45,633 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:45,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1074503396, now seen corresponding path program 1 times [2018-10-26 23:14:45,634 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:45,634 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:45,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:47,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:47,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:47,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:14:47,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:47,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:47,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:47,357 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-10-26 23:14:47,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:47,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:47,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:47,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:47,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:47,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:47,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:47,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:47,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:47,414 INFO L87 Difference]: Start difference. First operand 752 states and 1121 transitions. Second operand 7 states. [2018-10-26 23:14:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:50,449 INFO L93 Difference]: Finished difference Result 1536 states and 2289 transitions. [2018-10-26 23:14:50,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:50,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-10-26 23:14:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:50,454 INFO L225 Difference]: With dead ends: 1536 [2018-10-26 23:14:50,454 INFO L226 Difference]: Without dead ends: 835 [2018-10-26 23:14:50,455 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-10-26 23:14:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-10-26 23:14:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 752. [2018-10-26 23:14:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-26 23:14:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1119 transitions. [2018-10-26 23:14:50,498 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1119 transitions. Word has length 125 [2018-10-26 23:14:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:50,498 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1119 transitions. [2018-10-26 23:14:50,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1119 transitions. [2018-10-26 23:14:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 23:14:50,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:50,500 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-10-26 23:14:50,500 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:50,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -610512905, now seen corresponding path program 1 times [2018-10-26 23:14:50,501 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:50,501 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:50,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:51,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:51,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:51,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:14:51,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:51,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:51,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:51,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:14:51,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-10-26 23:14:51,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:51,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:51,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:51,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:51,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:14:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:14:51,301 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:51,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:51,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:14:51,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:14:51,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:14:51,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:14:51,305 INFO L87 Difference]: Start difference. First operand 752 states and 1119 transitions. Second operand 4 states. [2018-10-26 23:14:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:53,825 INFO L93 Difference]: Finished difference Result 1545 states and 2306 transitions. [2018-10-26 23:14:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:14:53,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-10-26 23:14:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:53,829 INFO L225 Difference]: With dead ends: 1545 [2018-10-26 23:14:53,829 INFO L226 Difference]: Without dead ends: 844 [2018-10-26 23:14:53,830 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-10-26 23:14:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-10-26 23:14:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 784. [2018-10-26 23:14:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-10-26 23:14:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1171 transitions. [2018-10-26 23:14:53,898 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1171 transitions. Word has length 125 [2018-10-26 23:14:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:53,899 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 1171 transitions. [2018-10-26 23:14:53,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:14:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1171 transitions. [2018-10-26 23:14:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 23:14:53,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:53,909 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-10-26 23:14:53,909 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:53,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash 688533703, now seen corresponding path program 1 times [2018-10-26 23:14:53,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:53,910 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:53,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:55,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:55,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-10-26 23:14:55,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:14:55,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:55,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:55,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:55,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:55,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:55,173 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:55,175 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-10-26 23:14:55,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:55,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:55,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:55,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:55,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:55,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 13 treesize of output 5 [2018-10-26 23:14:55,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:55,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:55,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-10-26 23:14:55,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:55,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:55,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:55,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:55,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:55,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:55,223 INFO L87 Difference]: Start difference. First operand 784 states and 1171 transitions. Second operand 7 states. [2018-10-26 23:14:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:14:56,090 INFO L93 Difference]: Finished difference Result 1600 states and 2389 transitions. [2018-10-26 23:14:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:14:56,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2018-10-26 23:14:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:14:56,093 INFO L225 Difference]: With dead ends: 1600 [2018-10-26 23:14:56,093 INFO L226 Difference]: Without dead ends: 867 [2018-10-26 23:14:56,094 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-10-26 23:14:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-10-26 23:14:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 784. [2018-10-26 23:14:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-10-26 23:14:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1169 transitions. [2018-10-26 23:14:56,135 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1169 transitions. Word has length 126 [2018-10-26 23:14:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:14:56,135 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 1169 transitions. [2018-10-26 23:14:56,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:14:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1169 transitions. [2018-10-26 23:14:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:14:56,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:14:56,137 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-10-26 23:14:56,137 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:14:56,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:14:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2013258762, now seen corresponding path program 1 times [2018-10-26 23:14:56,138 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:14:56,138 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:14:56,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:14:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:14:57,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:14:57,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:14:57,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:14:57,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:57,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:57,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:57,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:14:57,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:14:57,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:14:57,458 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-10-26 23:14:57,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:57,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:57,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-10-26 23:14:57,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:14:57,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:14:57,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:14:57,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:14:57,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:57,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:14:57,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:14:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:14:57,503 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:14:57,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:14:57,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:14:57,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:14:57,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:14:57,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:14:57,508 INFO L87 Difference]: Start difference. First operand 784 states and 1169 transitions. Second operand 7 states. [2018-10-26 23:15:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:00,539 INFO L93 Difference]: Finished difference Result 1594 states and 2378 transitions. [2018-10-26 23:15:00,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:15:00,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-10-26 23:15:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:00,542 INFO L225 Difference]: With dead ends: 1594 [2018-10-26 23:15:00,542 INFO L226 Difference]: Without dead ends: 861 [2018-10-26 23:15:00,543 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-10-26 23:15:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-10-26 23:15:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 784. [2018-10-26 23:15:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-10-26 23:15:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1167 transitions. [2018-10-26 23:15:00,622 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1167 transitions. Word has length 127 [2018-10-26 23:15:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:00,623 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 1167 transitions. [2018-10-26 23:15:00,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:15:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1167 transitions. [2018-10-26 23:15:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:15:00,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:00,624 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-10-26 23:15:00,624 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:00,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash -931767889, now seen corresponding path program 1 times [2018-10-26 23:15:00,625 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:00,625 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:00,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:01,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:01,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:15:01,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:15:01,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:01,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:01,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:01,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:15:01,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:15:01,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:15:01,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:01,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:01,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:01,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:15:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:01,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:01,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:01,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:15:01,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:15:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:15:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:15:01,431 INFO L87 Difference]: Start difference. First operand 784 states and 1167 transitions. Second operand 4 states. [2018-10-26 23:15:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:04,211 INFO L93 Difference]: Finished difference Result 1702 states and 2548 transitions. [2018-10-26 23:15:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:15:04,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-10-26 23:15:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:04,216 INFO L225 Difference]: With dead ends: 1702 [2018-10-26 23:15:04,216 INFO L226 Difference]: Without dead ends: 969 [2018-10-26 23:15:04,218 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-10-26 23:15:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-10-26 23:15:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 856. [2018-10-26 23:15:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-26 23:15:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1293 transitions. [2018-10-26 23:15:04,329 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1293 transitions. Word has length 127 [2018-10-26 23:15:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:04,329 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1293 transitions. [2018-10-26 23:15:04,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:15:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1293 transitions. [2018-10-26 23:15:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 23:15:04,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:04,331 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-10-26 23:15:04,331 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:04,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash -144502945, now seen corresponding path program 1 times [2018-10-26 23:15:04,344 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:04,344 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:04,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:05,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:05,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:15:05,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:15:05,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:15:05,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:05,782 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:05,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:15:05,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:15:05,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:15:05,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-10-26 23:15:05,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:05,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:15:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:15:05,835 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:05,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:05,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:15:05,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:15:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:15:05,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:15:05,840 INFO L87 Difference]: Start difference. First operand 856 states and 1293 transitions. Second operand 7 states. [2018-10-26 23:15:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:06,825 INFO L93 Difference]: Finished difference Result 1738 states and 2626 transitions. [2018-10-26 23:15:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:15:06,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2018-10-26 23:15:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:06,829 INFO L225 Difference]: With dead ends: 1738 [2018-10-26 23:15:06,829 INFO L226 Difference]: Without dead ends: 933 [2018-10-26 23:15:06,831 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-10-26 23:15:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-10-26 23:15:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 856. [2018-10-26 23:15:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-26 23:15:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1291 transitions. [2018-10-26 23:15:06,924 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1291 transitions. Word has length 128 [2018-10-26 23:15:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:06,924 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1291 transitions. [2018-10-26 23:15:06,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:15:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1291 transitions. [2018-10-26 23:15:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:15:06,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:06,926 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-10-26 23:15:06,926 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:06,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:06,926 INFO L82 PathProgramCache]: Analyzing trace with hash 352615278, now seen corresponding path program 1 times [2018-10-26 23:15:06,927 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:08,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:08,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:15:08,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:15:08,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:15:08,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:08,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:08,380 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-10-26 23:15:08,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:15:08,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-10-26 23:15:08,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:15:08,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:08,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:15:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:15:08,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:08,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:08,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:15:08,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:15:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:15:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:15:08,431 INFO L87 Difference]: Start difference. First operand 856 states and 1291 transitions. Second operand 7 states. [2018-10-26 23:15:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:11,470 INFO L93 Difference]: Finished difference Result 1732 states and 2615 transitions. [2018-10-26 23:15:11,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:15:11,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-10-26 23:15:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:11,474 INFO L225 Difference]: With dead ends: 1732 [2018-10-26 23:15:11,474 INFO L226 Difference]: Without dead ends: 927 [2018-10-26 23:15:11,475 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-10-26 23:15:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-26 23:15:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 856. [2018-10-26 23:15:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-26 23:15:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1289 transitions. [2018-10-26 23:15:11,530 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1289 transitions. Word has length 129 [2018-10-26 23:15:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:11,545 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1289 transitions. [2018-10-26 23:15:11,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:15:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1289 transitions. [2018-10-26 23:15:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 23:15:11,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:11,552 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-10-26 23:15:11,552 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:11,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1883428026, now seen corresponding path program 1 times [2018-10-26 23:15:11,553 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:11,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:11,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:13,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:13,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:13,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:15:13,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:13,044 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-10-26 23:15:13,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:13,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:13,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:13,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:13,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:15:13,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:15:13,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:15:13,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:13,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:13,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:13,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:15:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:13,109 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:13,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:13,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:15:13,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:15:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:15:13,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:15:13,114 INFO L87 Difference]: Start difference. First operand 856 states and 1289 transitions. Second operand 7 states. [2018-10-26 23:15:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:13,992 INFO L93 Difference]: Finished difference Result 1730 states and 2603 transitions. [2018-10-26 23:15:13,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:15:13,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-10-26 23:15:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:13,996 INFO L225 Difference]: With dead ends: 1730 [2018-10-26 23:15:13,996 INFO L226 Difference]: Without dead ends: 925 [2018-10-26 23:15:13,997 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-10-26 23:15:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-26 23:15:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 856. [2018-10-26 23:15:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-26 23:15:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1287 transitions. [2018-10-26 23:15:14,041 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1287 transitions. Word has length 131 [2018-10-26 23:15:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:14,041 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1287 transitions. [2018-10-26 23:15:14,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:15:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1287 transitions. [2018-10-26 23:15:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 23:15:14,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:14,042 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-10-26 23:15:14,043 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:14,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:14,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1403715890, now seen corresponding path program 1 times [2018-10-26 23:15:14,044 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:14,044 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:14,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:15,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:15,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 18 treesize of output 15 [2018-10-26 23:15:15,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:15:15,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:15,509 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-10-26 23:15:15,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:15,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:15,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:15,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:15,534 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:15:15,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:15:15,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:15:15,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:15,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:15,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:15,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:15:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:15,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:15,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:15,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:15:15,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:15:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:15:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:15:15,582 INFO L87 Difference]: Start difference. First operand 856 states and 1287 transitions. Second operand 7 states. [2018-10-26 23:15:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:18,667 INFO L93 Difference]: Finished difference Result 1730 states and 2599 transitions. [2018-10-26 23:15:18,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:15:18,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-10-26 23:15:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:18,669 INFO L225 Difference]: With dead ends: 1730 [2018-10-26 23:15:18,670 INFO L226 Difference]: Without dead ends: 925 [2018-10-26 23:15:18,671 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-10-26 23:15:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-26 23:15:18,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 856. [2018-10-26 23:15:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-26 23:15:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1285 transitions. [2018-10-26 23:15:18,758 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1285 transitions. Word has length 132 [2018-10-26 23:15:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:18,758 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1285 transitions. [2018-10-26 23:15:18,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:15:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1285 transitions. [2018-10-26 23:15:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 23:15:18,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:18,759 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-10-26 23:15:18,759 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:18,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash -620242207, now seen corresponding path program 1 times [2018-10-26 23:15:18,764 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:18,764 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:18,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:20,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:20,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:15:20,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:15:20,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:20,475 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-10-26 23:15:20,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:20,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:20,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:20,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-10-26 23:15:20,503 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:15:20,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:15:20,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-10-26 23:15:20,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:20,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:20,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:20,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:15:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:20,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:20,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:20,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:15:20,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:15:20,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:15:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:15:20,563 INFO L87 Difference]: Start difference. First operand 856 states and 1285 transitions. Second operand 7 states. [2018-10-26 23:15:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:23,524 INFO L93 Difference]: Finished difference Result 1730 states and 2595 transitions. [2018-10-26 23:15:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:15:23,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-10-26 23:15:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:23,528 INFO L225 Difference]: With dead ends: 1730 [2018-10-26 23:15:23,528 INFO L226 Difference]: Without dead ends: 925 [2018-10-26 23:15:23,529 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-10-26 23:15:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-26 23:15:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 856. [2018-10-26 23:15:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-26 23:15:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1283 transitions. [2018-10-26 23:15:23,573 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1283 transitions. Word has length 133 [2018-10-26 23:15:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:23,573 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1283 transitions. [2018-10-26 23:15:23,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:15:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1283 transitions. [2018-10-26 23:15:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 23:15:23,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:23,575 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-10-26 23:15:23,575 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:23,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 989904841, now seen corresponding path program 1 times [2018-10-26 23:15:23,576 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:23,576 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:23,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:25,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:25,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:25,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:15:25,044 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:25,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 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:15:25,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:25,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:25,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:25,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:25,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:15:25,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:15:25,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:15:25,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:25,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:25,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:25,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:15:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:25,109 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:25,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:25,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:15:25,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:15:25,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:15:25,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:15:25,114 INFO L87 Difference]: Start difference. First operand 856 states and 1283 transitions. Second operand 7 states. [2018-10-26 23:15:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:25,993 INFO L93 Difference]: Finished difference Result 1710 states and 2565 transitions. [2018-10-26 23:15:25,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:15:25,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2018-10-26 23:15:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:25,996 INFO L225 Difference]: With dead ends: 1710 [2018-10-26 23:15:25,996 INFO L226 Difference]: Without dead ends: 905 [2018-10-26 23:15:25,997 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-10-26 23:15:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-10-26 23:15:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 856. [2018-10-26 23:15:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-26 23:15:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1281 transitions. [2018-10-26 23:15:26,042 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1281 transitions. Word has length 134 [2018-10-26 23:15:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:26,042 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1281 transitions. [2018-10-26 23:15:26,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:15:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1281 transitions. [2018-10-26 23:15:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 23:15:26,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:26,043 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-10-26 23:15:26,045 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:26,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:26,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1067965209, now seen corresponding path program 1 times [2018-10-26 23:15:26,046 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:26,046 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:26,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:26,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 23:15:26,236 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:26,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:26,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:26,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:26,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:26,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:26,239 INFO L87 Difference]: Start difference. First operand 856 states and 1281 transitions. Second operand 3 states. [2018-10-26 23:15:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:26,339 INFO L93 Difference]: Finished difference Result 1712 states and 2569 transitions. [2018-10-26 23:15:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:26,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-10-26 23:15:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:26,342 INFO L225 Difference]: With dead ends: 1712 [2018-10-26 23:15:26,342 INFO L226 Difference]: Without dead ends: 907 [2018-10-26 23:15:26,343 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-10-26 23:15:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-10-26 23:15:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2018-10-26 23:15:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-10-26 23:15:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1349 transitions. [2018-10-26 23:15:26,400 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1349 transitions. Word has length 134 [2018-10-26 23:15:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:26,400 INFO L481 AbstractCegarLoop]: Abstraction has 907 states and 1349 transitions. [2018-10-26 23:15:26,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1349 transitions. [2018-10-26 23:15:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-26 23:15:26,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:26,402 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-10-26 23:15:26,402 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:26,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1268524905, now seen corresponding path program 1 times [2018-10-26 23:15:26,403 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:26,403 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:26,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:27,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:27,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:27,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:15:27,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:27,889 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-10-26 23:15:27,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:27,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:27,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:27,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:27,912 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:15:27,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:15:27,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-10-26 23:15:27,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:27,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:27,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-10-26 23:15:27,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:15:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:27,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:15:27,978 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:15:27,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:27,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:27,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:15:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:28,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:15:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:15:28,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:15:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:15:28,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:15:28,027 INFO L87 Difference]: Start difference. First operand 907 states and 1349 transitions. Second operand 9 states. [2018-10-26 23:15:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:31,919 INFO L93 Difference]: Finished difference Result 2297 states and 3427 transitions. [2018-10-26 23:15:31,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:15:31,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-10-26 23:15:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:31,924 INFO L225 Difference]: With dead ends: 2297 [2018-10-26 23:15:31,925 INFO L226 Difference]: Without dead ends: 1441 [2018-10-26 23:15:31,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:15:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-10-26 23:15:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 989. [2018-10-26 23:15:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2018-10-26 23:15:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1493 transitions. [2018-10-26 23:15:31,986 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1493 transitions. Word has length 137 [2018-10-26 23:15:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:31,986 INFO L481 AbstractCegarLoop]: Abstraction has 989 states and 1493 transitions. [2018-10-26 23:15:31,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:15:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1493 transitions. [2018-10-26 23:15:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 23:15:31,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:31,988 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-10-26 23:15:31,988 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:31,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:31,988 INFO L82 PathProgramCache]: Analyzing trace with hash 359789298, now seen corresponding path program 1 times [2018-10-26 23:15:31,989 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:31,989 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:32,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:33,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:33,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:33,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:15:33,653 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:33,656 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-10-26 23:15:33,657 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:33,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:33,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:33,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-10-26 23:15:33,683 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:15:33,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-10-26 23:15:33,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-10-26 23:15:33,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:33,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:33,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:33,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:15:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 65 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:33,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:15:33,766 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:15:33,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:33,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:33,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:15:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:33,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:15:33,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:15:33,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:15:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:15:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:15:33,795 INFO L87 Difference]: Start difference. First operand 989 states and 1493 transitions. Second operand 9 states. [2018-10-26 23:15:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:37,638 INFO L93 Difference]: Finished difference Result 2409 states and 3637 transitions. [2018-10-26 23:15:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:15:37,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-10-26 23:15:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:37,641 INFO L225 Difference]: With dead ends: 2409 [2018-10-26 23:15:37,641 INFO L226 Difference]: Without dead ends: 1471 [2018-10-26 23:15:37,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:15:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2018-10-26 23:15:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1031. [2018-10-26 23:15:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-26 23:15:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1579 transitions. [2018-10-26 23:15:37,712 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1579 transitions. Word has length 138 [2018-10-26 23:15:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:37,713 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 1579 transitions. [2018-10-26 23:15:37,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:15:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1579 transitions. [2018-10-26 23:15:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 23:15:37,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:37,714 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-10-26 23:15:37,714 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:37,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1791025874, now seen corresponding path program 1 times [2018-10-26 23:15:37,715 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:37,716 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:37,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:39,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:39,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:39,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:15:39,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:39,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:39,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:39,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:15:39,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:39,373 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:39,375 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-10-26 23:15:39,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:39,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:39,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:39,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:15:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:15:39,432 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:39,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:39,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:15:39,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:15:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:15:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:15:39,438 INFO L87 Difference]: Start difference. First operand 1031 states and 1579 transitions. Second operand 7 states. [2018-10-26 23:15:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:42,302 INFO L93 Difference]: Finished difference Result 2069 states and 3170 transitions. [2018-10-26 23:15:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:15:42,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2018-10-26 23:15:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:42,305 INFO L225 Difference]: With dead ends: 2069 [2018-10-26 23:15:42,305 INFO L226 Difference]: Without dead ends: 1089 [2018-10-26 23:15:42,307 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-10-26 23:15:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-10-26 23:15:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1037. [2018-10-26 23:15:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-10-26 23:15:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1585 transitions. [2018-10-26 23:15:42,365 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1585 transitions. Word has length 139 [2018-10-26 23:15:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:42,365 INFO L481 AbstractCegarLoop]: Abstraction has 1037 states and 1585 transitions. [2018-10-26 23:15:42,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:15:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1585 transitions. [2018-10-26 23:15:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-26 23:15:42,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:42,367 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-10-26 23:15:42,367 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:42,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash -751085099, now seen corresponding path program 1 times [2018-10-26 23:15:42,368 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:42,368 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:42,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:43,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:43,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:43,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:15:43,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:43,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:43,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:43,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:15:43,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-10-26 23:15:43,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:15:43,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:43,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:43,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:43,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:15:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:43,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:15:43,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:43,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:15:43,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:15:43,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:15:43,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:15:43,456 INFO L87 Difference]: Start difference. First operand 1037 states and 1585 transitions. Second operand 4 states. [2018-10-26 23:15:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:46,276 INFO L93 Difference]: Finished difference Result 2131 states and 3249 transitions. [2018-10-26 23:15:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:15:46,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-10-26 23:15:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:46,281 INFO L225 Difference]: With dead ends: 2131 [2018-10-26 23:15:46,295 INFO L226 Difference]: Without dead ends: 1145 [2018-10-26 23:15:46,300 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-10-26 23:15:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-10-26 23:15:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1037. [2018-10-26 23:15:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-10-26 23:15:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1583 transitions. [2018-10-26 23:15:46,363 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1583 transitions. Word has length 157 [2018-10-26 23:15:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:46,363 INFO L481 AbstractCegarLoop]: Abstraction has 1037 states and 1583 transitions. [2018-10-26 23:15:46,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:15:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1583 transitions. [2018-10-26 23:15:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-26 23:15:46,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:46,365 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-10-26 23:15:46,366 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:46,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:46,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1743639229, now seen corresponding path program 1 times [2018-10-26 23:15:46,367 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:46,367 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:46,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:48,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:48,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:15:48,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:15:48,385 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:48,389 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-10-26 23:15:48,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:48,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:48,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:48,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:48,418 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:15:48,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:15:48,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:15:48,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:48,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:48,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:48,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:15:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 150 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:48,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:15:48,499 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:15:48,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:48,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-10-26 23:15:48,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:15:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:48,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:15:48,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:15:48,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:15:48,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:15:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:15:48,528 INFO L87 Difference]: Start difference. First operand 1037 states and 1583 transitions. Second operand 9 states. [2018-10-26 23:15:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:52,615 INFO L93 Difference]: Finished difference Result 2609 states and 3995 transitions. [2018-10-26 23:15:52,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:15:52,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2018-10-26 23:15:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:52,618 INFO L225 Difference]: With dead ends: 2609 [2018-10-26 23:15:52,619 INFO L226 Difference]: Without dead ends: 1623 [2018-10-26 23:15:52,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:15:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2018-10-26 23:15:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1169. [2018-10-26 23:15:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-10-26 23:15:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1811 transitions. [2018-10-26 23:15:52,702 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1811 transitions. Word has length 167 [2018-10-26 23:15:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:52,702 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1811 transitions. [2018-10-26 23:15:52,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:15:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1811 transitions. [2018-10-26 23:15:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 23:15:52,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:52,704 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-10-26 23:15:52,705 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:52,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1135663639, now seen corresponding path program 1 times [2018-10-26 23:15:52,706 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:52,706 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:52,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:54,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:15:54,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:15:54,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:15:54,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:15:54,824 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-10-26 23:15:54,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,846 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:15:54,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:15:54,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:15:54,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:15:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 160 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:54,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:15:54,923 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:15:54,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:15:54,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:15:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:15:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:15:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:15:54,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:15:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:15:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:15:54,961 INFO L87 Difference]: Start difference. First operand 1169 states and 1811 transitions. Second operand 9 states. [2018-10-26 23:15:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:58,921 INFO L93 Difference]: Finished difference Result 2799 states and 4311 transitions. [2018-10-26 23:15:58,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:15:58,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2018-10-26 23:15:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:58,926 INFO L225 Difference]: With dead ends: 2799 [2018-10-26 23:15:58,927 INFO L226 Difference]: Without dead ends: 1681 [2018-10-26 23:15:58,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:15:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2018-10-26 23:15:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1245. [2018-10-26 23:15:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2018-10-26 23:15:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1941 transitions. [2018-10-26 23:15:59,011 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1941 transitions. Word has length 173 [2018-10-26 23:15:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:59,011 INFO L481 AbstractCegarLoop]: Abstraction has 1245 states and 1941 transitions. [2018-10-26 23:15:59,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:15:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1941 transitions. [2018-10-26 23:15:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 23:15:59,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:59,014 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-10-26 23:15:59,014 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:59,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash -308595164, now seen corresponding path program 1 times [2018-10-26 23:15:59,015 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:15:59,015 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:15:59,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:01,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:01,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:16:01,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:16:01,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:01,053 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-10-26 23:16:01,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,061 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,078 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:16:01,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:01,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:16:01,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:16:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 162 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:16:01,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:16:01,152 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:16:01,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:01,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:16:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:16:01,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:16:01,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:16:01,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:16:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:16:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:16:01,185 INFO L87 Difference]: Start difference. First operand 1245 states and 1941 transitions. Second operand 9 states. [2018-10-26 23:16:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:16:06,786 INFO L93 Difference]: Finished difference Result 2863 states and 4420 transitions. [2018-10-26 23:16:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:16:06,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2018-10-26 23:16:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:16:06,790 INFO L225 Difference]: With dead ends: 2863 [2018-10-26 23:16:06,790 INFO L226 Difference]: Without dead ends: 1669 [2018-10-26 23:16:06,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 343 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-10-26 23:16:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2018-10-26 23:16:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1245. [2018-10-26 23:16:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2018-10-26 23:16:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1937 transitions. [2018-10-26 23:16:06,855 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1937 transitions. Word has length 174 [2018-10-26 23:16:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:16:06,856 INFO L481 AbstractCegarLoop]: Abstraction has 1245 states and 1937 transitions. [2018-10-26 23:16:06,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:16:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1937 transitions. [2018-10-26 23:16:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-26 23:16:06,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:16:06,858 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-10-26 23:16:06,858 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:16:06,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:16:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 609362711, now seen corresponding path program 1 times [2018-10-26 23:16:06,859 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:16:06,859 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:16:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:08,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:08,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 18 treesize of output 15 [2018-10-26 23:16:08,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:16:08,951 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:08,954 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-10-26 23:16:08,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:08,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:08,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:08,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:08,982 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:16:08,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:08,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:16:08,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:09,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:09,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:09,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:16:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:16:09,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:16:09,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:16:09,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:16:09,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:16:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:16:09,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:16:09,030 INFO L87 Difference]: Start difference. First operand 1245 states and 1937 transitions. Second operand 7 states. [2018-10-26 23:16:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:16:09,915 INFO L93 Difference]: Finished difference Result 2469 states and 3850 transitions. [2018-10-26 23:16:09,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:16:09,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2018-10-26 23:16:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:16:09,918 INFO L225 Difference]: With dead ends: 2469 [2018-10-26 23:16:09,918 INFO L226 Difference]: Without dead ends: 1275 [2018-10-26 23:16:09,919 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-10-26 23:16:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2018-10-26 23:16:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1245. [2018-10-26 23:16:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2018-10-26 23:16:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1935 transitions. [2018-10-26 23:16:09,984 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1935 transitions. Word has length 174 [2018-10-26 23:16:09,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:16:09,984 INFO L481 AbstractCegarLoop]: Abstraction has 1245 states and 1935 transitions. [2018-10-26 23:16:09,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:16:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1935 transitions. [2018-10-26 23:16:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 23:16:09,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:16:09,986 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-10-26 23:16:09,986 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:16:09,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:16:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash 72233480, now seen corresponding path program 1 times [2018-10-26 23:16:09,987 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:16:09,987 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:16:10,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:13,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:13,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:13,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, 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-10-26 23:16:13,551 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-10-26 23:16:13,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:13,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:13,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:13,585 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-10-26 23:16:13,585 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,716 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-10-26 23:16:13,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, 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-10-26 23:16:13,726 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:13,729 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-10-26 23:16:13,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:13,737 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:13,739 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:13,742 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-10-26 23:16:13,742 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,757 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,775 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,815 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-10-26 23:16:13,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:13,822 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,828 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:13,860 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-10-26 23:16:13,861 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-10-26 23:16:14,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:14,026 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-10-26 23:16:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 23:16:14,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:14,078 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:16:14,079 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-10-26 23:16:14,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-10-26 23:16:14,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, 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-10-26 23:16:14,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:14,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-10-26 23:16:14,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:14,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:14,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-10-26 23:16:14,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:14,256 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-10-26 23:16:14,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:14,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:14,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 24 treesize of output 1 [2018-10-26 23:16:14,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-10-26 23:16:14,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:16:14,367 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:14,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:14,370 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:16:14,375 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-10-26 23:16:14,376 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:16:14,386 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:16:14,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,397 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-10-26 23:16:14,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:14,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:14,428 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-10-26 23:16:14,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:16:14,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 23:16:14,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:16:14,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:16:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:16:14,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:16:14,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:14,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2018-10-26 23:16:14,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:14,778 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-10-26 23:16:14,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:32 [2018-10-26 23:16:14,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-10-26 23:16:14,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 11 treesize of output 10 [2018-10-26 23:16:14,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:15,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 10 treesize of output 8 [2018-10-26 23:16:15,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:16:15,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:15,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:15,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:15,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:15,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-10-26 23:16:15,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:15,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:15,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:15,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:15,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:15,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-10-26 23:16:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:16:15,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:16:15,559 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:16:15,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:15,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:16,052 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-10-26 23:16:16,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,103 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-10-26 23:16:16,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:16,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,161 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-10-26 23:16:16,164 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-10-26 23:16:16,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:16,171 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-10-26 23:16:16,175 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:16,177 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:16,180 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:16,186 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-10-26 23:16:16,186 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,199 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,208 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,235 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-10-26 23:16:16,235 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-10-26 23:16:16,365 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-10-26 23:16:16,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:16,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:16,422 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:16:16,422 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-10-26 23:16:16,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-10-26 23:16:16,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:16,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-10-26 23:16:16,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 23:16:16,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:16,537 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-10-26 23:16:16,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 23:16:16,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:16,597 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:16:16,598 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-10-26 23:16:16,598 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:16:16,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:16:16,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-10-26 23:16:16,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:16,634 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:16:16,637 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-10-26 23:16:16,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:16:16,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:16,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:16:16,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:16:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:16:16,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:16:16,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-10-26 23:16:16,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:16,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:16,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-26 23:16:16,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:16,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-10-26 23:16:16,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-10-26 23:16:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:16:17,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 23:16:17,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-10-26 23:16:17,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-26 23:16:17,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-26 23:16:17,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-10-26 23:16:17,263 INFO L87 Difference]: Start difference. First operand 1245 states and 1935 transitions. Second operand 24 states. [2018-10-26 23:16:31,702 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-26 23:16:33,861 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-10-26 23:16:36,182 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-10-26 23:16:39,802 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-26 23:16:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:16:41,153 INFO L93 Difference]: Finished difference Result 2827 states and 4344 transitions. [2018-10-26 23:16:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:16:41,156 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 184 [2018-10-26 23:16:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:16:41,158 INFO L225 Difference]: With dead ends: 2827 [2018-10-26 23:16:41,158 INFO L226 Difference]: Without dead ends: 1633 [2018-10-26 23:16:41,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 709 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-10-26 23:16:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-10-26 23:16:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1177. [2018-10-26 23:16:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:16:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1817 transitions. [2018-10-26 23:16:41,239 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1817 transitions. Word has length 184 [2018-10-26 23:16:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:16:41,239 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1817 transitions. [2018-10-26 23:16:41,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-26 23:16:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1817 transitions. [2018-10-26 23:16:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 23:16:41,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:16:41,241 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-10-26 23:16:41,241 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:16:41,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:16:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1300440610, now seen corresponding path program 1 times [2018-10-26 23:16:41,242 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:16:41,242 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:16:41,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:42,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:42,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:42,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:42,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:42,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:42,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:42,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:16:42,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:16:42,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:16:42,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:42,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:42,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:42,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:16:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:16:42,439 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:16:42,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:16:42,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:16:42,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:16:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:16:42,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:16:42,448 INFO L87 Difference]: Start difference. First operand 1177 states and 1817 transitions. Second operand 4 states. [2018-10-26 23:16:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:16:45,098 INFO L93 Difference]: Finished difference Result 2344 states and 3625 transitions. [2018-10-26 23:16:45,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:16:45,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 23:16:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:16:45,102 INFO L225 Difference]: With dead ends: 2344 [2018-10-26 23:16:45,102 INFO L226 Difference]: Without dead ends: 1218 [2018-10-26 23:16:45,104 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-10-26 23:16:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-10-26 23:16:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1177. [2018-10-26 23:16:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:16:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1815 transitions. [2018-10-26 23:16:45,182 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1815 transitions. Word has length 184 [2018-10-26 23:16:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:16:45,182 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1815 transitions. [2018-10-26 23:16:45,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:16:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1815 transitions. [2018-10-26 23:16:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 23:16:45,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:16:45,184 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-10-26 23:16:45,184 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:16:45,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:16:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash -835595406, now seen corresponding path program 1 times [2018-10-26 23:16:45,185 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:16:45,185 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:16:45,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:46,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:46,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:46,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:46,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:46,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:46,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:46,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:16:46,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:16:46,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:16:46,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:46,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:46,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:46,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:16:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:16:46,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:16:46,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:16:46,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:16:46,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:16:46,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:16:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:16:46,321 INFO L87 Difference]: Start difference. First operand 1177 states and 1815 transitions. Second operand 4 states. [2018-10-26 23:16:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:16:48,874 INFO L93 Difference]: Finished difference Result 2344 states and 3621 transitions. [2018-10-26 23:16:48,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:16:48,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 23:16:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:16:48,878 INFO L225 Difference]: With dead ends: 2344 [2018-10-26 23:16:48,878 INFO L226 Difference]: Without dead ends: 1218 [2018-10-26 23:16:48,880 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-10-26 23:16:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-10-26 23:16:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1177. [2018-10-26 23:16:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:16:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1813 transitions. [2018-10-26 23:16:48,966 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1813 transitions. Word has length 184 [2018-10-26 23:16:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:16:48,967 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1813 transitions. [2018-10-26 23:16:48,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:16:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1813 transitions. [2018-10-26 23:16:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:16:48,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:16:48,968 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-10-26 23:16:48,969 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:16:48,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:16:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1789756988, now seen corresponding path program 1 times [2018-10-26 23:16:48,970 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:16:48,970 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:16:48,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:50,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:50,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:16:50,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:50,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:50,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:50,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:50,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:16:50,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:50,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:16:50,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:50,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:50,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:50,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:16:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:16:50,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:16:50,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:16:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:16:50,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:16:50,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:16:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:16:50,214 INFO L87 Difference]: Start difference. First operand 1177 states and 1813 transitions. Second operand 4 states. [2018-10-26 23:16:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:16:52,776 INFO L93 Difference]: Finished difference Result 2344 states and 3617 transitions. [2018-10-26 23:16:52,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:16:52,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-10-26 23:16:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:16:52,781 INFO L225 Difference]: With dead ends: 2344 [2018-10-26 23:16:52,781 INFO L226 Difference]: Without dead ends: 1218 [2018-10-26 23:16:52,783 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-10-26 23:16:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-10-26 23:16:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1177. [2018-10-26 23:16:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:16:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1811 transitions. [2018-10-26 23:16:52,867 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1811 transitions. Word has length 185 [2018-10-26 23:16:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:16:52,867 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1811 transitions. [2018-10-26 23:16:52,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:16:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1811 transitions. [2018-10-26 23:16:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:16:52,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:16:52,869 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-10-26 23:16:52,869 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:16:52,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:16:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1818646973, now seen corresponding path program 1 times [2018-10-26 23:16:52,870 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:16:52,870 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:16:52,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:54,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:54,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 13 treesize of output 10 [2018-10-26 23:16:54,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:54,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:54,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:54,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:54,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:16:54,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:16:54,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-10-26 23:16:54,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:54,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:54,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:54,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:16:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:16:54,118 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:16:54,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:16:54,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:16:54,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:16:54,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:16:54,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:16:54,124 INFO L87 Difference]: Start difference. First operand 1177 states and 1811 transitions. Second operand 4 states. [2018-10-26 23:16:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:16:56,912 INFO L93 Difference]: Finished difference Result 2411 states and 3701 transitions. [2018-10-26 23:16:56,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:16:56,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-10-26 23:16:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:16:56,918 INFO L225 Difference]: With dead ends: 2411 [2018-10-26 23:16:56,918 INFO L226 Difference]: Without dead ends: 1285 [2018-10-26 23:16:56,920 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-10-26 23:16:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-10-26 23:16:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1177. [2018-10-26 23:16:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:16:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1809 transitions. [2018-10-26 23:16:57,002 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1809 transitions. Word has length 185 [2018-10-26 23:16:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:16:57,002 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1809 transitions. [2018-10-26 23:16:57,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:16:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1809 transitions. [2018-10-26 23:16:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-26 23:16:57,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:16:57,004 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-10-26 23:16:57,004 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:16:57,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:16:57,004 INFO L82 PathProgramCache]: Analyzing trace with hash -637469897, now seen corresponding path program 1 times [2018-10-26 23:16:57,005 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:16:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:16:57,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:16:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:16:58,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:16:58,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:16:58,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:16:58,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:58,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:58,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:58,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:16:58,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:16:58,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:16:58,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:16:58,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:58,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:16:58,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:16:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:16:58,270 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:16:58,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:16:58,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:16:58,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:16:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:16:58,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:16:58,276 INFO L87 Difference]: Start difference. First operand 1177 states and 1809 transitions. Second operand 4 states. [2018-10-26 23:17:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:00,938 INFO L93 Difference]: Finished difference Result 2344 states and 3609 transitions. [2018-10-26 23:17:00,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:00,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-10-26 23:17:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:00,942 INFO L225 Difference]: With dead ends: 2344 [2018-10-26 23:17:00,942 INFO L226 Difference]: Without dead ends: 1218 [2018-10-26 23:17:00,943 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-10-26 23:17:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-10-26 23:17:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1177. [2018-10-26 23:17:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:17:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1807 transitions. [2018-10-26 23:17:01,034 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1807 transitions. Word has length 186 [2018-10-26 23:17:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:01,034 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1807 transitions. [2018-10-26 23:17:01,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1807 transitions. [2018-10-26 23:17:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-26 23:17:01,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:01,044 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-10-26 23:17:01,044 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:01,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash -364683994, now seen corresponding path program 1 times [2018-10-26 23:17:01,046 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:01,046 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:01,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:02,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:02,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:17:02,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:17:02,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:02,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:02,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:02,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:02,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:17:02,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:17:02,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:02,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:02,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:02,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:17:02,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:02,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:02,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:02,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:02,347 INFO L87 Difference]: Start difference. First operand 1177 states and 1807 transitions. Second operand 4 states. [2018-10-26 23:17:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:05,045 INFO L93 Difference]: Finished difference Result 2391 states and 3669 transitions. [2018-10-26 23:17:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:05,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-10-26 23:17:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:05,050 INFO L225 Difference]: With dead ends: 2391 [2018-10-26 23:17:05,050 INFO L226 Difference]: Without dead ends: 1265 [2018-10-26 23:17:05,067 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-10-26 23:17:05,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-10-26 23:17:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1177. [2018-10-26 23:17:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:17:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1805 transitions. [2018-10-26 23:17:05,139 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1805 transitions. Word has length 186 [2018-10-26 23:17:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:05,139 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1805 transitions. [2018-10-26 23:17:05,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1805 transitions. [2018-10-26 23:17:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-26 23:17:05,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:05,141 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-10-26 23:17:05,141 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:05,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash 100161210, now seen corresponding path program 1 times [2018-10-26 23:17:05,142 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:05,143 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:05,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:06,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:06,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:06,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:17:06,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:06,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:06,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:06,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:06,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:17:06,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:17:06,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:06,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:06,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:06,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:17:06,530 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:06,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:06,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:06,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:06,537 INFO L87 Difference]: Start difference. First operand 1177 states and 1805 transitions. Second operand 4 states. [2018-10-26 23:17:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:09,273 INFO L93 Difference]: Finished difference Result 2391 states and 3665 transitions. [2018-10-26 23:17:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:09,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-10-26 23:17:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:09,278 INFO L225 Difference]: With dead ends: 2391 [2018-10-26 23:17:09,278 INFO L226 Difference]: Without dead ends: 1265 [2018-10-26 23:17:09,279 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-10-26 23:17:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-10-26 23:17:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1177. [2018-10-26 23:17:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:17:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1803 transitions. [2018-10-26 23:17:09,356 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1803 transitions. Word has length 186 [2018-10-26 23:17:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:09,356 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1803 transitions. [2018-10-26 23:17:09,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1803 transitions. [2018-10-26 23:17:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-26 23:17:09,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:09,358 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-10-26 23:17:09,358 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:09,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:09,359 INFO L82 PathProgramCache]: Analyzing trace with hash 284926883, now seen corresponding path program 1 times [2018-10-26 23:17:09,359 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:09,359 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:09,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:10,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:10,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:10,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:17:10,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:10,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:10,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:10,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:10,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:17:10,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:17:10,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:10,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:10,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:10,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:17:10,549 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:10,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:10,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:10,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:10,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:10,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:10,554 INFO L87 Difference]: Start difference. First operand 1177 states and 1803 transitions. Second operand 4 states. [2018-10-26 23:17:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:13,424 INFO L93 Difference]: Finished difference Result 2387 states and 3657 transitions. [2018-10-26 23:17:13,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:13,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-10-26 23:17:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:13,430 INFO L225 Difference]: With dead ends: 2387 [2018-10-26 23:17:13,430 INFO L226 Difference]: Without dead ends: 1261 [2018-10-26 23:17:13,432 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-10-26 23:17:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2018-10-26 23:17:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1177. [2018-10-26 23:17:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:17:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1801 transitions. [2018-10-26 23:17:13,524 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1801 transitions. Word has length 186 [2018-10-26 23:17:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:13,524 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1801 transitions. [2018-10-26 23:17:13,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1801 transitions. [2018-10-26 23:17:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 23:17:13,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:13,526 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-10-26 23:17:13,526 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:13,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:13,527 INFO L82 PathProgramCache]: Analyzing trace with hash -780864479, now seen corresponding path program 1 times [2018-10-26 23:17:13,527 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:13,528 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:13,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:14,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:14,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 13 treesize of output 10 [2018-10-26 23:17:14,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 10 treesize of output 9 [2018-10-26 23:17:14,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:14,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:14,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:14,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:14,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:17:14,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:17:14,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:14,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:14,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:14,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:17:14,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:14,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:14,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:14,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:14,879 INFO L87 Difference]: Start difference. First operand 1177 states and 1801 transitions. Second operand 4 states. [2018-10-26 23:17:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:17,470 INFO L93 Difference]: Finished difference Result 2324 states and 3567 transitions. [2018-10-26 23:17:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:17,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-10-26 23:17:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:17,474 INFO L225 Difference]: With dead ends: 2324 [2018-10-26 23:17:17,474 INFO L226 Difference]: Without dead ends: 1198 [2018-10-26 23:17:17,475 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-10-26 23:17:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-10-26 23:17:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1145. [2018-10-26 23:17:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-10-26 23:17:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1757 transitions. [2018-10-26 23:17:17,566 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1757 transitions. Word has length 187 [2018-10-26 23:17:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:17,566 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1757 transitions. [2018-10-26 23:17:17,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1757 transitions. [2018-10-26 23:17:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 23:17:17,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:17,568 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-10-26 23:17:17,568 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:17,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 733441012, now seen corresponding path program 1 times [2018-10-26 23:17:17,569 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:17,569 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:17,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:18,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:18,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:18,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:17:18,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:18,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:18,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:18,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:18,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:17:18,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:17:18,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:18,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:18,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:18,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:17:18,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:18,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:18,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:18,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:18,934 INFO L87 Difference]: Start difference. First operand 1145 states and 1757 transitions. Second operand 4 states. [2018-10-26 23:17:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:21,748 INFO L93 Difference]: Finished difference Result 2323 states and 3565 transitions. [2018-10-26 23:17:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:21,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-10-26 23:17:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:21,754 INFO L225 Difference]: With dead ends: 2323 [2018-10-26 23:17:21,754 INFO L226 Difference]: Without dead ends: 1229 [2018-10-26 23:17:21,755 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-10-26 23:17:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-26 23:17:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1145. [2018-10-26 23:17:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-10-26 23:17:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1755 transitions. [2018-10-26 23:17:21,841 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1755 transitions. Word has length 187 [2018-10-26 23:17:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:21,841 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1755 transitions. [2018-10-26 23:17:21,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1755 transitions. [2018-10-26 23:17:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 23:17:21,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:21,843 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-10-26 23:17:21,843 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:21,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash 976473215, now seen corresponding path program 1 times [2018-10-26 23:17:21,845 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:21,845 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:21,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:23,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:23,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:23,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:17:23,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:23,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:23,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:23,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:23,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:17:23,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:17:23,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:23,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:23,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:23,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:17:23,152 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:23,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:23,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:23,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:23,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:23,158 INFO L87 Difference]: Start difference. First operand 1145 states and 1755 transitions. Second operand 4 states. [2018-10-26 23:17:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:25,850 INFO L93 Difference]: Finished difference Result 2323 states and 3561 transitions. [2018-10-26 23:17:25,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:25,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-26 23:17:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:25,854 INFO L225 Difference]: With dead ends: 2323 [2018-10-26 23:17:25,854 INFO L226 Difference]: Without dead ends: 1229 [2018-10-26 23:17:25,855 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-10-26 23:17:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-26 23:17:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1145. [2018-10-26 23:17:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-10-26 23:17:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1753 transitions. [2018-10-26 23:17:25,932 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1753 transitions. Word has length 188 [2018-10-26 23:17:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:25,933 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1753 transitions. [2018-10-26 23:17:25,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1753 transitions. [2018-10-26 23:17:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 23:17:25,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:25,934 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-10-26 23:17:25,935 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:25,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2006731737, now seen corresponding path program 1 times [2018-10-26 23:17:25,940 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:25,940 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:25,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:27,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:27,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:27,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:17:27,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:27,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:27,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:27,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:27,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:17:27,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:17:27,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:27,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:27,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:27,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:17:27,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:27,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:27,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:27,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:27,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:27,134 INFO L87 Difference]: Start difference. First operand 1145 states and 1753 transitions. Second operand 4 states. [2018-10-26 23:17:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:29,928 INFO L93 Difference]: Finished difference Result 2303 states and 3531 transitions. [2018-10-26 23:17:29,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:29,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-26 23:17:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:29,932 INFO L225 Difference]: With dead ends: 2303 [2018-10-26 23:17:29,932 INFO L226 Difference]: Without dead ends: 1209 [2018-10-26 23:17:29,934 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-10-26 23:17:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2018-10-26 23:17:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1145. [2018-10-26 23:17:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-10-26 23:17:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1751 transitions. [2018-10-26 23:17:30,016 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1751 transitions. Word has length 189 [2018-10-26 23:17:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:30,016 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1751 transitions. [2018-10-26 23:17:30,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1751 transitions. [2018-10-26 23:17:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 23:17:30,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:30,018 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-10-26 23:17:30,018 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:30,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1489985562, now seen corresponding path program 1 times [2018-10-26 23:17:30,019 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:30,019 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:30,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:31,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:31,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:31,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:17:31,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:31,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:31,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:31,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:31,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:17:31,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:17:31,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:31,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:31,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:31,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:17:31,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:31,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:31,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:31,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:31,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:31,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:31,377 INFO L87 Difference]: Start difference. First operand 1145 states and 1751 transitions. Second operand 4 states. [2018-10-26 23:17:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:34,121 INFO L93 Difference]: Finished difference Result 2303 states and 3527 transitions. [2018-10-26 23:17:34,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:34,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-26 23:17:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:34,126 INFO L225 Difference]: With dead ends: 2303 [2018-10-26 23:17:34,126 INFO L226 Difference]: Without dead ends: 1209 [2018-10-26 23:17:34,128 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-10-26 23:17:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2018-10-26 23:17:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1145. [2018-10-26 23:17:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-10-26 23:17:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1749 transitions. [2018-10-26 23:17:34,221 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1749 transitions. Word has length 189 [2018-10-26 23:17:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:34,222 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1749 transitions. [2018-10-26 23:17:34,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1749 transitions. [2018-10-26 23:17:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 23:17:34,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:34,224 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-10-26 23:17:34,224 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:34,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:34,224 INFO L82 PathProgramCache]: Analyzing trace with hash 460211104, now seen corresponding path program 1 times [2018-10-26 23:17:34,225 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:34,225 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:34,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:35,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:35,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:35,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:17:35,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:35,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:35,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:35,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 23:17:35,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:17:35,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:17:35,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:35,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:35,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:35,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:17:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:17:35,527 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:35,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:35,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:17:35,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:17:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:17:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:17:35,533 INFO L87 Difference]: Start difference. First operand 1145 states and 1749 transitions. Second operand 4 states. [2018-10-26 23:17:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:38,170 INFO L93 Difference]: Finished difference Result 2287 states and 3497 transitions. [2018-10-26 23:17:38,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:17:38,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-10-26 23:17:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:38,174 INFO L225 Difference]: With dead ends: 2287 [2018-10-26 23:17:38,174 INFO L226 Difference]: Without dead ends: 1193 [2018-10-26 23:17:38,176 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-10-26 23:17:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-10-26 23:17:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1145. [2018-10-26 23:17:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-10-26 23:17:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1747 transitions. [2018-10-26 23:17:38,255 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1747 transitions. Word has length 190 [2018-10-26 23:17:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:38,255 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1747 transitions. [2018-10-26 23:17:38,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:17:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1747 transitions. [2018-10-26 23:17:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 23:17:38,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:38,257 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-10-26 23:17:38,257 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:38,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:38,257 INFO L82 PathProgramCache]: Analyzing trace with hash -979638619, now seen corresponding path program 1 times [2018-10-26 23:17:38,258 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:38,258 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:38,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:40,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:40,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:17:40,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:17:40,858 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-10-26 23:17:40,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:40,865 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:40,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:40,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-10-26 23:17:40,880 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:17:40,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:17:40,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:17:40,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:40,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:40,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:40,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:17:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 230 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:17:40,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:17:40,972 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:17:40,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:40,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:40,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:17:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:17:40,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:17:40,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:17:40,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:17:40,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:17:40,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:17:40,999 INFO L87 Difference]: Start difference. First operand 1145 states and 1747 transitions. Second operand 9 states. [2018-10-26 23:17:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:44,684 INFO L93 Difference]: Finished difference Result 2663 states and 4030 transitions. [2018-10-26 23:17:44,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:17:44,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-10-26 23:17:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:44,690 INFO L225 Difference]: With dead ends: 2663 [2018-10-26 23:17:44,690 INFO L226 Difference]: Without dead ends: 1569 [2018-10-26 23:17:44,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 385 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-10-26 23:17:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-26 23:17:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1145. [2018-10-26 23:17:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-10-26 23:17:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1739 transitions. [2018-10-26 23:17:44,788 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1739 transitions. Word has length 195 [2018-10-26 23:17:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:44,788 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1739 transitions. [2018-10-26 23:17:44,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:17:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1739 transitions. [2018-10-26 23:17:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 23:17:44,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:44,790 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-10-26 23:17:44,790 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:44,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:44,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1212191426, now seen corresponding path program 1 times [2018-10-26 23:17:44,791 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:44,791 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:44,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:47,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:47,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:17:47,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 23:17:47,457 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:17:47,460 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-10-26 23:17:47,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:47,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:47,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:47,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:47,490 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:17:47,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:17:47,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:17:47,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:47,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:47,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:47,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:17:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:17:47,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:47,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:47,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:17:47,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:17:47,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:17:47,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:17:47,553 INFO L87 Difference]: Start difference. First operand 1145 states and 1739 transitions. Second operand 7 states. [2018-10-26 23:17:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:48,722 INFO L93 Difference]: Finished difference Result 2443 states and 3717 transitions. [2018-10-26 23:17:48,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:17:48,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-10-26 23:17:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:48,726 INFO L225 Difference]: With dead ends: 2443 [2018-10-26 23:17:48,726 INFO L226 Difference]: Without dead ends: 1349 [2018-10-26 23:17:48,728 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-10-26 23:17:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-10-26 23:17:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1169. [2018-10-26 23:17:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-10-26 23:17:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1773 transitions. [2018-10-26 23:17:48,817 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1773 transitions. Word has length 196 [2018-10-26 23:17:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:48,817 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1773 transitions. [2018-10-26 23:17:48,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:17:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1773 transitions. [2018-10-26 23:17:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 23:17:48,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:48,819 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-10-26 23:17:48,819 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:48,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash -747346222, now seen corresponding path program 1 times [2018-10-26 23:17:48,820 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:48,820 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:48,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:51,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:51,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:17:51,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:17:51,473 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:17:51,476 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-10-26 23:17:51,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:51,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:51,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:51,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:51,507 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:17:51,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-10-26 23:17:51,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-10-26 23:17:51,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:51,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:51,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:51,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:17:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:17:51,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:17:51,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:17:51,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:17:51,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:17:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:17:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:17:51,590 INFO L87 Difference]: Start difference. First operand 1169 states and 1773 transitions. Second operand 7 states. [2018-10-26 23:17:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:17:54,966 INFO L93 Difference]: Finished difference Result 2467 states and 3749 transitions. [2018-10-26 23:17:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:17:54,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-10-26 23:17:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:17:54,970 INFO L225 Difference]: With dead ends: 2467 [2018-10-26 23:17:54,970 INFO L226 Difference]: Without dead ends: 1349 [2018-10-26 23:17:54,972 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-10-26 23:17:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-10-26 23:17:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1171. [2018-10-26 23:17:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-10-26 23:17:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1775 transitions. [2018-10-26 23:17:55,061 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1775 transitions. Word has length 196 [2018-10-26 23:17:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:17:55,061 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1775 transitions. [2018-10-26 23:17:55,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:17:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1775 transitions. [2018-10-26 23:17:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 23:17:55,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:17:55,063 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-10-26 23:17:55,063 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:17:55,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:17:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash -562580549, now seen corresponding path program 1 times [2018-10-26 23:17:55,064 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:17:55,064 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:17:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:17:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:17:57,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:17:57,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:17:57,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:17:57,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:17:57,498 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-10-26 23:17:57,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,527 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:17:57,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 23:17:57,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 23:17:57,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:17:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 233 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:17:57,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:17:57,658 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:17:57,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:17:57,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:17:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:17:57,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:17:57,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:17:57,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:17:57,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:17:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:17:57,691 INFO L87 Difference]: Start difference. First operand 1171 states and 1775 transitions. Second operand 9 states. [2018-10-26 23:18:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:01,712 INFO L93 Difference]: Finished difference Result 2665 states and 4016 transitions. [2018-10-26 23:18:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:18:01,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2018-10-26 23:18:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:01,718 INFO L225 Difference]: With dead ends: 2665 [2018-10-26 23:18:01,718 INFO L226 Difference]: Without dead ends: 1545 [2018-10-26 23:18:01,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 387 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-10-26 23:18:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2018-10-26 23:18:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1171. [2018-10-26 23:18:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-10-26 23:18:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1767 transitions. [2018-10-26 23:18:01,842 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1767 transitions. Word has length 196 [2018-10-26 23:18:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:01,843 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1767 transitions. [2018-10-26 23:18:01,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:18:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1767 transitions. [2018-10-26 23:18:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 23:18:01,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:01,845 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-10-26 23:18:01,845 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:01,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash 230514396, now seen corresponding path program 1 times [2018-10-26 23:18:01,846 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:01,846 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:01,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:04,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:04,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:18:04,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:18:04,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:04,519 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-10-26 23:18:04,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:04,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:04,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:04,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:04,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:18:04,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:18:04,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:18:04,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:04,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:04,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:04,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:18:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:18:04,720 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:18:04,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:04,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:18:04,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:04,727 INFO L87 Difference]: Start difference. First operand 1171 states and 1767 transitions. Second operand 7 states. [2018-10-26 23:18:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:07,950 INFO L93 Difference]: Finished difference Result 2465 states and 3727 transitions. [2018-10-26 23:18:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:18:07,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2018-10-26 23:18:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:07,955 INFO L225 Difference]: With dead ends: 2465 [2018-10-26 23:18:07,955 INFO L226 Difference]: Without dead ends: 1345 [2018-10-26 23:18:07,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:18:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-26 23:18:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1173. [2018-10-26 23:18:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-10-26 23:18:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1769 transitions. [2018-10-26 23:18:08,068 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1769 transitions. Word has length 197 [2018-10-26 23:18:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:08,068 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1769 transitions. [2018-10-26 23:18:08,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:18:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1769 transitions. [2018-10-26 23:18:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 23:18:08,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:08,070 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-10-26 23:18:08,070 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:08,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1365092667, now seen corresponding path program 1 times [2018-10-26 23:18:08,071 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:08,071 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:08,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:10,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:10,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:18:10,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:18:10,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:18:10,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 23:18:10,488 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:10,490 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-10-26 23:18:10,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:18:10,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:18:10,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:18:10,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:10,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:18:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 23:18:10,708 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:18:10,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:10,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:18:10,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:10,713 INFO L87 Difference]: Start difference. First operand 1173 states and 1769 transitions. Second operand 7 states. [2018-10-26 23:18:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:13,932 INFO L93 Difference]: Finished difference Result 2347 states and 3542 transitions. [2018-10-26 23:18:13,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:18:13,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2018-10-26 23:18:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:13,937 INFO L225 Difference]: With dead ends: 2347 [2018-10-26 23:18:13,937 INFO L226 Difference]: Without dead ends: 1225 [2018-10-26 23:18:13,939 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-10-26 23:18:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-26 23:18:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1173. [2018-10-26 23:18:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-10-26 23:18:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1767 transitions. [2018-10-26 23:18:14,041 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1767 transitions. Word has length 197 [2018-10-26 23:18:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:14,041 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1767 transitions. [2018-10-26 23:18:14,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:18:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1767 transitions. [2018-10-26 23:18:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 23:18:14,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:14,043 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-10-26 23:18:14,043 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:14,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash -21817396, now seen corresponding path program 1 times [2018-10-26 23:18:14,045 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:14,045 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:14,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:16,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:16,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 23:18: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-10-26 23:18:16,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 23:18:16,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:18:16,639 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:16,642 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-10-26 23:18:16,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 23:18:16,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:18:16,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:18:16,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:16,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:18:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 23:18:16,715 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:18:16,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:16,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:18:16,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:16,722 INFO L87 Difference]: Start difference. First operand 1173 states and 1767 transitions. Second operand 7 states. [2018-10-26 23:18:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:19,869 INFO L93 Difference]: Finished difference Result 2335 states and 3522 transitions. [2018-10-26 23:18:19,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:18:19,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2018-10-26 23:18:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:19,874 INFO L225 Difference]: With dead ends: 2335 [2018-10-26 23:18:19,874 INFO L226 Difference]: Without dead ends: 1213 [2018-10-26 23:18:19,876 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-10-26 23:18:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2018-10-26 23:18:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1173. [2018-10-26 23:18:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-10-26 23:18:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1765 transitions. [2018-10-26 23:18:19,977 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1765 transitions. Word has length 198 [2018-10-26 23:18:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:19,977 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1765 transitions. [2018-10-26 23:18:19,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:18:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1765 transitions. [2018-10-26 23:18:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 23:18:19,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:19,979 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-10-26 23:18:19,979 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:19,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1729349993, now seen corresponding path program 1 times [2018-10-26 23:18:19,980 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:19,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:20,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:22,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:22,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-10-26 23:18:22,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-10-26 23:18:22,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:22,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-10-26 23:18:22,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:22,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:22,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:22,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:22,637 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:18:22,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:18:22,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-10-26 23:18:22,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:22,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:22,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:22,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:18:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:18:22,704 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:18:22,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:22,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:18:22,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:22,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:22,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:22,717 INFO L87 Difference]: Start difference. First operand 1173 states and 1765 transitions. Second operand 7 states. [2018-10-26 23:18:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:25,856 INFO L93 Difference]: Finished difference Result 2467 states and 3719 transitions. [2018-10-26 23:18:25,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:18:25,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2018-10-26 23:18:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:25,861 INFO L225 Difference]: With dead ends: 2467 [2018-10-26 23:18:25,861 INFO L226 Difference]: Without dead ends: 1345 [2018-10-26 23:18:25,862 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-10-26 23:18:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-26 23:18:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1175. [2018-10-26 23:18:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-10-26 23:18:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1767 transitions. [2018-10-26 23:18:25,949 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1767 transitions. Word has length 198 [2018-10-26 23:18:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:25,950 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1767 transitions. [2018-10-26 23:18:25,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:18:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1767 transitions. [2018-10-26 23:18:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 23:18:25,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:25,951 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-10-26 23:18:25,951 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:25,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash -269409087, now seen corresponding path program 1 times [2018-10-26 23:18:25,952 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:25,953 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:25,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:28,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:28,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:18:28,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:18:28,488 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:28,492 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-10-26 23:18:28,493 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:28,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:28,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:28,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:28,518 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:18:28,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:18:28,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:18:28,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:28,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:28,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:28,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:18:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 23:18:28,570 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:18:28,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:28,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:18:28,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:28,576 INFO L87 Difference]: Start difference. First operand 1175 states and 1767 transitions. Second operand 7 states. [2018-10-26 23:18:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:29,756 INFO L93 Difference]: Finished difference Result 2449 states and 3693 transitions. [2018-10-26 23:18:29,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:18:29,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2018-10-26 23:18:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:29,762 INFO L225 Difference]: With dead ends: 2449 [2018-10-26 23:18:29,762 INFO L226 Difference]: Without dead ends: 1325 [2018-10-26 23:18:29,764 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-10-26 23:18:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2018-10-26 23:18:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1177. [2018-10-26 23:18:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 23:18:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1769 transitions. [2018-10-26 23:18:29,868 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1769 transitions. Word has length 199 [2018-10-26 23:18:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:29,868 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1769 transitions. [2018-10-26 23:18:29,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:18:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1769 transitions. [2018-10-26 23:18:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 23:18:29,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:29,870 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-10-26 23:18:29,870 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:29,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:29,871 INFO L82 PathProgramCache]: Analyzing trace with hash -786155262, now seen corresponding path program 1 times [2018-10-26 23:18:29,872 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:29,872 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:29,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:32,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:32,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 18 treesize of output 15 [2018-10-26 23:18:32,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:18:32,779 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:32,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:18:32,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,812 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:18:32,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-10-26 23:18:32,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:18:32,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:18:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 224 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:18:32,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:18:32,913 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:18:32,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:32,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 23:18:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:18:32,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:18:32,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:18:32,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:18:32,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:18:32,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:18:32,945 INFO L87 Difference]: Start difference. First operand 1177 states and 1769 transitions. Second operand 9 states. [2018-10-26 23:18:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:36,448 INFO L93 Difference]: Finished difference Result 2733 states and 4098 transitions. [2018-10-26 23:18:36,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:18:36,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2018-10-26 23:18:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:36,453 INFO L225 Difference]: With dead ends: 2733 [2018-10-26 23:18:36,453 INFO L226 Difference]: Without dead ends: 1607 [2018-10-26 23:18:36,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:18:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-10-26 23:18:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1235. [2018-10-26 23:18:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-26 23:18:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1859 transitions. [2018-10-26 23:18:36,556 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1859 transitions. Word has length 199 [2018-10-26 23:18:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:36,557 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1859 transitions. [2018-10-26 23:18:36,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:18:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1859 transitions. [2018-10-26 23:18:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 23:18:36,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:36,558 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-10-26 23:18:36,558 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:36,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1380677704, now seen corresponding path program 1 times [2018-10-26 23:18:36,559 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:36,559 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:36,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:39,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:39,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:18:39,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:18:39,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:39,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:18:39,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,260 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:18:39,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:18:39,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 23:18:39,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:18:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 227 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:18:39,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:18:39,338 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:18:39,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:39,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:18:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 23:18:39,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:18:39,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:18:39,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:18:39,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:18:39,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:18:39,369 INFO L87 Difference]: Start difference. First operand 1235 states and 1859 transitions. Second operand 9 states. [2018-10-26 23:18:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:43,093 INFO L93 Difference]: Finished difference Result 2751 states and 4116 transitions. [2018-10-26 23:18:43,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:18:43,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2018-10-26 23:18:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:43,099 INFO L225 Difference]: With dead ends: 2751 [2018-10-26 23:18:43,099 INFO L226 Difference]: Without dead ends: 1567 [2018-10-26 23:18:43,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 395 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-10-26 23:18:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2018-10-26 23:18:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1235. [2018-10-26 23:18:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-26 23:18:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1849 transitions. [2018-10-26 23:18:43,217 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1849 transitions. Word has length 200 [2018-10-26 23:18:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:43,218 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1849 transitions. [2018-10-26 23:18:43,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:18:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1849 transitions. [2018-10-26 23:18:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 23:18:43,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:43,220 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-10-26 23:18:43,220 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:43,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash 267768399, now seen corresponding path program 1 times [2018-10-26 23:18:43,221 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:43,221 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:43,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:46,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:46,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 18 treesize of output 15 [2018-10-26 23:18:46,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:18:46,845 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:46,853 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-10-26 23:18:46,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:46,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:46,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:46,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:46,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:18:46,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:18:46,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:18:46,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:46,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:46,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-10-26 23:18:46,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:18:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:18:47,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:18:47,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:47,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:18:47,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:47,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:47,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:47,045 INFO L87 Difference]: Start difference. First operand 1235 states and 1849 transitions. Second operand 7 states. [2018-10-26 23:18:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:50,527 INFO L93 Difference]: Finished difference Result 2561 states and 3829 transitions. [2018-10-26 23:18:50,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:18:50,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2018-10-26 23:18:50,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:50,530 INFO L225 Difference]: With dead ends: 2561 [2018-10-26 23:18:50,530 INFO L226 Difference]: Without dead ends: 1377 [2018-10-26 23:18:50,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:18:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-10-26 23:18:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1235. [2018-10-26 23:18:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-26 23:18:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1847 transitions. [2018-10-26 23:18:50,654 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1847 transitions. Word has length 203 [2018-10-26 23:18:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:50,655 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1847 transitions. [2018-10-26 23:18:50,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:18:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1847 transitions. [2018-10-26 23:18:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 23:18:50,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:50,657 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-10-26 23:18:50,657 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:50,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:50,657 INFO L82 PathProgramCache]: Analyzing trace with hash 732613603, now seen corresponding path program 1 times [2018-10-26 23:18:50,658 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:50,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:54,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:54,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:18:54,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:18:54,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:54,205 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-10-26 23:18:54,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:54,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:54,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:54,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:54,239 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:18:54,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:18:54,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:18:54,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:54,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:54,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-10-26 23:18:54,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:18:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:18:54,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:18:54,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:54,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:18:54,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:54,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:54,336 INFO L87 Difference]: Start difference. First operand 1235 states and 1847 transitions. Second operand 7 states. [2018-10-26 23:18:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:55,817 INFO L93 Difference]: Finished difference Result 2561 states and 3825 transitions. [2018-10-26 23:18:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:18:55,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2018-10-26 23:18:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:55,823 INFO L225 Difference]: With dead ends: 2561 [2018-10-26 23:18:55,823 INFO L226 Difference]: Without dead ends: 1377 [2018-10-26 23:18:55,824 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-10-26 23:18:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-10-26 23:18:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1235. [2018-10-26 23:18:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-26 23:18:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1845 transitions. [2018-10-26 23:18:55,943 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1845 transitions. Word has length 203 [2018-10-26 23:18:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:55,943 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1845 transitions. [2018-10-26 23:18:55,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:18:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1845 transitions. [2018-10-26 23:18:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 23:18:55,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:55,945 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-10-26 23:18:55,945 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:55,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:55,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1135371285, now seen corresponding path program 1 times [2018-10-26 23:18:55,946 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:18:55,946 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:18:55,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:59,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:59,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 23:18:59,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:18:59,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:18:59,385 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-10-26 23:18:59,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:59,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:59,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:59,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:59,417 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:18:59,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:18:59,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:18:59,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:18:59,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:59,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:18:59,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:18:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:18:59,491 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:18:59,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:59,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:18:59,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:59,501 INFO L87 Difference]: Start difference. First operand 1235 states and 1845 transitions. Second operand 7 states. [2018-10-26 23:19:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:19:02,969 INFO L93 Difference]: Finished difference Result 2561 states and 3821 transitions. [2018-10-26 23:19:02,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:19:02,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2018-10-26 23:19:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:19:02,974 INFO L225 Difference]: With dead ends: 2561 [2018-10-26 23:19:02,974 INFO L226 Difference]: Without dead ends: 1377 [2018-10-26 23:19:02,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:19:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-10-26 23:19:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1235. [2018-10-26 23:19:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-26 23:19:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1843 transitions. [2018-10-26 23:19:03,103 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1843 transitions. Word has length 204 [2018-10-26 23:19:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:19:03,103 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1843 transitions. [2018-10-26 23:19:03,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:19:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1843 transitions. [2018-10-26 23:19:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 23:19:03,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:19:03,105 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-10-26 23:19:03,105 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:19:03,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:19:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1122133144, now seen corresponding path program 1 times [2018-10-26 23:19:03,107 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:19:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:19:03,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:19:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:06,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:19:06,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:19:06,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:19:06,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:06,573 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-10-26 23:19:06,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:06,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:06,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:06,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:06,603 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:19:06,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-10-26 23:19:06,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 23:19:06,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:06,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:06,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:06,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:19:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:19:06,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:19:06,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:19:06,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:19:06,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:19:06,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:19:06,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:19:06,675 INFO L87 Difference]: Start difference. First operand 1235 states and 1843 transitions. Second operand 7 states. [2018-10-26 23:19:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:19:07,909 INFO L93 Difference]: Finished difference Result 2561 states and 3817 transitions. [2018-10-26 23:19:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:19:07,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 205 [2018-10-26 23:19:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:19:07,914 INFO L225 Difference]: With dead ends: 2561 [2018-10-26 23:19:07,914 INFO L226 Difference]: Without dead ends: 1377 [2018-10-26 23:19:07,915 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-10-26 23:19:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-10-26 23:19:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1235. [2018-10-26 23:19:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-26 23:19:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1841 transitions. [2018-10-26 23:19:08,037 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1841 transitions. Word has length 205 [2018-10-26 23:19:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:19:08,037 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1841 transitions. [2018-10-26 23:19:08,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:19:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1841 transitions. [2018-10-26 23:19:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-26 23:19:08,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:19:08,039 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-10-26 23:19:08,039 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:19:08,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:19:08,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1374444048, now seen corresponding path program 1 times [2018-10-26 23:19:08,041 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:19:08,041 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:19:08,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:19:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:11,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:19:11,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:19:11,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:19:11,453 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:11,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:19:11,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:11,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:11,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:11,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:11,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:19:11,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:11,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:19:11,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:11,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:11,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:11,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 23:19:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 23:19:11,562 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:19:11,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:19:11,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:19:11,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:19:11,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:19:11,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:19:11,571 INFO L87 Difference]: Start difference. First operand 1235 states and 1841 transitions. Second operand 7 states. [2018-10-26 23:19:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:19:13,058 INFO L93 Difference]: Finished difference Result 2541 states and 3787 transitions. [2018-10-26 23:19:13,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:19:13,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 206 [2018-10-26 23:19:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:19:13,062 INFO L225 Difference]: With dead ends: 2541 [2018-10-26 23:19:13,062 INFO L226 Difference]: Without dead ends: 1357 [2018-10-26 23:19:13,064 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-10-26 23:19:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2018-10-26 23:19:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1235. [2018-10-26 23:19:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-26 23:19:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1839 transitions. [2018-10-26 23:19:13,243 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1839 transitions. Word has length 206 [2018-10-26 23:19:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:19:13,243 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1839 transitions. [2018-10-26 23:19:13,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:19:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1839 transitions. [2018-10-26 23:19:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-26 23:19:13,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:19:13,245 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-10-26 23:19:13,245 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:19:13,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:19:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash 857697873, now seen corresponding path program 1 times [2018-10-26 23:19:13,247 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:19:13,247 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:19:13,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:19:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:19,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:19:19,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 23:19:19,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:19,975 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-10-26 23:19:19,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:19:19,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:19,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,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, 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-10-26 23:19:20,051 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-10-26 23:19:20,057 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:20,062 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-10-26 23:19:20,069 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:20,074 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:20,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:20,094 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-10-26 23:19:20,095 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,114 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,128 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,169 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-10-26 23:19:20,169 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-10-26 23:19:20,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:19:20,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 23:19:20,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:20,308 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-10-26 23:19:20,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:19:20,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:20,356 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-10-26 23:19:20,422 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-10-26 23:19:20,422 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 23:19:20,484 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:20,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:20,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:20,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:20,656 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-10-26 23:19:20,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 31 treesize of output 28 [2018-10-26 23:19:20,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-26 23:19:20,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:20,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-10-26 23:19:20,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-10-26 23:19:20,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:20,853 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-10-26 23:19:20,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-10-26 23:19:20,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:20,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 13 treesize of output 5 [2018-10-26 23:19:20,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:20,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:19:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:19:21,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:19:21,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:19:21,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 23:19:21,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:21,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:21,176 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-10-26 23:19:21,236 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:19:21,299 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-10-26 23:19:21,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 23:19:21,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-26 23:19:21,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:19:21,347 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:21,354 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:21,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-10-26 23:19:21,362 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:19:21,364 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:19:21,366 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-10-26 23:19:21,366 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:21,396 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:21,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:21,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:21,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:21,435 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-10-26 23:19:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:19:21,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:19:21,572 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:19:21,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:19:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:21,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:19:22,062 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-26 23:19:22,069 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-10-26 23:19:22,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,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, 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-10-26 23:19:22,141 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-10-26 23:19:22,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 23:19:22,167 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,175 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,193 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-10-26 23:19:22,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,371 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-10-26 23:19:22,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 23:19:22,384 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,392 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-10-26 23:19:22,401 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,406 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,411 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,428 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-10-26 23:19:22,428 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,449 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,463 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,477 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,518 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-10-26 23:19:22,518 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-10-26 23:19:22,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-10-26 23:19:22,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 10 treesize of output 9 [2018-10-26 23:19:22,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,758 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,779 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-10-26 23:19:22,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 22 treesize of output 21 [2018-10-26 23:19:22,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:22,806 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:22,816 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-10-26 23:19:22,866 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-10-26 23:19:22,866 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 23:19:22,889 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:22,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:22,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:22,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:22,976 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-10-26 23:19:23,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:19:23,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:19:23,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:23,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:19:23,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:23,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:23,139 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-10-26 23:19:23,139 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,144 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,150 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-10-26 23:19:23,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 17 treesize of output 13 [2018-10-26 23:19:23,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:19:23,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:19:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:19:23,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:19:23,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:19:23,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:19:23,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:23,359 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-10-26 23:19:23,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:19:23,523 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-10-26 23:19:23,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 23:19:23,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:23,584 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:19:23,587 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:19:23,588 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-10-26 23:19:23,588 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,596 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:23,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 14 treesize of output 1 [2018-10-26 23:19:23,604 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,613 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:23,652 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-10-26 23:19:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:19:23,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 23:19:23,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-10-26 23:19:23,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 23:19:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 23:19:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:19:23,761 INFO L87 Difference]: Start difference. First operand 1235 states and 1839 transitions. Second operand 19 states. [2018-10-26 23:19:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:19:43,179 INFO L93 Difference]: Finished difference Result 7559 states and 11206 transitions. [2018-10-26 23:19:43,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 23:19:43,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2018-10-26 23:19:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:19:43,188 INFO L225 Difference]: With dead ends: 7559 [2018-10-26 23:19:43,188 INFO L226 Difference]: Without dead ends: 6375 [2018-10-26 23:19:43,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 23:19:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2018-10-26 23:19:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 1389. [2018-10-26 23:19:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2018-10-26 23:19:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2103 transitions. [2018-10-26 23:19:43,359 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2103 transitions. Word has length 206 [2018-10-26 23:19:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:19:43,359 INFO L481 AbstractCegarLoop]: Abstraction has 1389 states and 2103 transitions. [2018-10-26 23:19:43,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 23:19:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2103 transitions. [2018-10-26 23:19:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 23:19:43,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:19:43,361 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-10-26 23:19:43,361 INFO L424 AbstractCegarLoop]: === Iteration 125 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:19:43,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:19:43,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1365187107, now seen corresponding path program 1 times [2018-10-26 23:19:43,363 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:19:43,363 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:19:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:19:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:46,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:19:46,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-10-26 23:19:46,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-10-26 23:19:46,180 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:46,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 23:19:46,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:46,198 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:46,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:46,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-10-26 23:19:46,220 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:19:46,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:46,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:19:46,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:46,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:46,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-10-26 23:19:46,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:19:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 23:19:46,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:19:46,324 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:19:46,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:46,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:46,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:19:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 23:19:46,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:19:46,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:19:46,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:19:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:19:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:19:46,363 INFO L87 Difference]: Start difference. First operand 1389 states and 2103 transitions. Second operand 9 states. [2018-10-26 23:19:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:19:52,461 INFO L93 Difference]: Finished difference Result 3065 states and 4610 transitions. [2018-10-26 23:19:52,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:19:52,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2018-10-26 23:19:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:19:52,467 INFO L225 Difference]: With dead ends: 3065 [2018-10-26 23:19:52,467 INFO L226 Difference]: Without dead ends: 1727 [2018-10-26 23:19:52,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 409 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-10-26 23:19:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2018-10-26 23:19:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1389. [2018-10-26 23:19:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2018-10-26 23:19:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2097 transitions. [2018-10-26 23:19:52,599 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2097 transitions. Word has length 207 [2018-10-26 23:19:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:19:52,600 INFO L481 AbstractCegarLoop]: Abstraction has 1389 states and 2097 transitions. [2018-10-26 23:19:52,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:19:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2097 transitions. [2018-10-26 23:19:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 23:19:52,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:19:52,602 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-10-26 23:19:52,602 INFO L424 AbstractCegarLoop]: === Iteration 126 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:19:52,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:19:52,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1848185976, now seen corresponding path program 1 times [2018-10-26 23:19:52,603 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:19:52,603 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:19:52,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:19:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:19:58,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:19:58,854 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-10-26 23:19:58,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:58,919 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-10-26 23:19:58,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:19:58,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:58,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:58,986 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-10-26 23:19:58,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 23:19:59,024 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:59,029 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-10-26 23:19:59,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:59,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:59,042 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:59,051 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-10-26 23:19:59,052 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,072 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,086 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,099 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,127 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-10-26 23:19:59,127 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-10-26 23:19:59,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:19:59,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:19:59,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:59,247 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-10-26 23:19:59,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 23:19:59,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:19:59,294 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-10-26 23:19:59,362 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-10-26 23:19:59,362 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 23:19:59,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:59,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:59,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:59,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:19:59,519 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-10-26 23:19:59,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:19:59,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:19:59,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:59,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:19:59,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-10-26 23:19:59,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:19:59,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:19:59,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-10-26 23:19:59,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 17 treesize of output 13 [2018-10-26 23:19:59,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:19:59,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:19:59,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:19:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:19:59,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:19:59,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:20:00,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:20:00,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:00,039 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:00,050 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-10-26 23:20:00,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:20:00,227 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-10-26 23:20:00,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 23:20:00,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 37 treesize of output 29 [2018-10-26 23:20:00,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:20:00,292 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:00,298 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:00,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:20:00,308 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:20:00,311 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:20:00,312 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-10-26 23:20:00,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:00,321 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:00,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:00,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:00,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:00,366 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-10-26 23:20:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:20:00,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:20:00,581 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:20:00,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:20:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:00,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:20:01,060 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-10-26 23:20:01,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,151 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-10-26 23:20:01,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, 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-10-26 23:20:01,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,179 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-10-26 23:20:01,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,223 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-10-26 23:20:01,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,273 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,334 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,407 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-10-26 23:20:01,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 23:20:01,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,435 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-10-26 23:20:01,445 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,451 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,455 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,470 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-10-26 23:20:01,471 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,495 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,512 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,528 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,573 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-10-26 23:20:01,573 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-10-26 23:20:01,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-10-26 23:20:01,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:20:01,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,766 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,792 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-10-26 23:20:01,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:20:01,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:01,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:01,833 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-10-26 23:20:01,914 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-10-26 23:20:01,914 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 23:20:01,941 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:20:01,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:20:01,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:20:02,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:20:02,046 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-10-26 23:20:02,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 23:20:02,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:20:02,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:20:02,203 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:20:02,203 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-10-26 23:20:02,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-10-26 23:20:02,231 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:20:02,232 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-10-26 23:20:02,232 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:20:02,244 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:20:02,255 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-10-26 23:20:02,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:20:02,258 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,265 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,275 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-10-26 23:20:02,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:20:02,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 13 treesize of output 5 [2018-10-26 23:20:02,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:20:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:20:02,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:20:02,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 98 [2018-10-26 23:20:02,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 23:20:02,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:02,566 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-10-26 23:20:02,653 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:20:02,713 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-10-26 23:20:02,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 23:20:02,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:20:02,759 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:20:02,762 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:20:02,763 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-10-26 23:20:02,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,770 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:20:02,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10-26 23:20:02,778 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,786 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:02,825 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-10-26 23:20:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 23:20:02,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 23:20:02,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-10-26 23:20:02,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 23:20:02,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 23:20:02,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:20:02,918 INFO L87 Difference]: Start difference. First operand 1389 states and 2097 transitions. Second operand 19 states. [2018-10-26 23:20:23,288 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-26 23:20:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:20:24,219 INFO L93 Difference]: Finished difference Result 7117 states and 10636 transitions. [2018-10-26 23:20:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 23:20:24,220 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 207 [2018-10-26 23:20:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:20:24,226 INFO L225 Difference]: With dead ends: 7117 [2018-10-26 23:20:24,227 INFO L226 Difference]: Without dead ends: 5779 [2018-10-26 23:20:24,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 808 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-10-26 23:20:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2018-10-26 23:20:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 1383. [2018-10-26 23:20:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-10-26 23:20:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2087 transitions. [2018-10-26 23:20:24,385 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2087 transitions. Word has length 207 [2018-10-26 23:20:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:20:24,386 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 2087 transitions. [2018-10-26 23:20:24,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 23:20:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2087 transitions. [2018-10-26 23:20:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-26 23:20:24,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:20:24,388 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-10-26 23:20:24,388 INFO L424 AbstractCegarLoop]: === Iteration 127 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:20:24,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:20:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash -166857986, now seen corresponding path program 1 times [2018-10-26 23:20:24,389 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:20:24,389 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:20:24,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:20:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:27,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:20:27,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 23:20:27,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 23:20:27,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:20:27,148 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-10-26 23:20:27,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,176 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 23:20:27,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 23:20:27,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 13 treesize of output 5 [2018-10-26 23:20:27,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 23:20:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 253 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 23:20:27,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:20:27,296 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:20:27,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:20:27,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 23:20:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 23:20:27,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:20:27,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 23:20:27,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:20:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:20:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:20:27,336 INFO L87 Difference]: Start difference. First operand 1383 states and 2087 transitions. Second operand 9 states. [2018-10-26 23:20:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:20:33,040 INFO L93 Difference]: Finished difference Result 3053 states and 4577 transitions. [2018-10-26 23:20:33,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:20:33,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2018-10-26 23:20:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:20:33,045 INFO L225 Difference]: With dead ends: 3053 [2018-10-26 23:20:33,045 INFO L226 Difference]: Without dead ends: 1721 [2018-10-26 23:20:33,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 411 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-10-26 23:20:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2018-10-26 23:20:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1383. [2018-10-26 23:20:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-10-26 23:20:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2081 transitions. [2018-10-26 23:20:33,168 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2081 transitions. Word has length 208 [2018-10-26 23:20:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:20:33,168 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 2081 transitions. [2018-10-26 23:20:33,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:20:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2081 transitions. [2018-10-26 23:20:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-26 23:20:33,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:20:33,170 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-10-26 23:20:33,170 INFO L424 AbstractCegarLoop]: === Iteration 128 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:20:33,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:20:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1430859666, now seen corresponding path program 1 times [2018-10-26 23:20:33,171 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:20:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/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-10-26 23:20:33,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:20:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:20:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:20:44,970 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 23:20:45,006 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,006 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,011 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,011 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,011 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,012 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:20:45 BoogieIcfgContainer [2018-10-26 23:20:45,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:20:45,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:20:45,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:20:45,098 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:20:45,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:10:25" (3/4) ... [2018-10-26 23:20:45,112 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:20:45,117 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,118 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,118 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,118 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,118 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,118 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 23:20:45,230 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9456a577-8a73-4c09-8250-34f5cf6324bd/bin-2019/utaipan/witness.graphml [2018-10-26 23:20:45,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:20:45,230 INFO L168 Benchmark]: Toolchain (without parser) took 625537.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 947.9 MB in the beginning and 746.2 MB in the end (delta: 201.7 MB). Peak memory consumption was 282.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:20:45,231 INFO L168 Benchmark]: CDTParser took 0.20 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-10-26 23:20:45,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1225.47 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 780.1 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:20:45,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 226.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 780.1 MB in the beginning and 1.1 GB in the end (delta: -311.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:20:45,238 INFO L168 Benchmark]: Boogie Preprocessor took 137.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:20:45,238 INFO L168 Benchmark]: RCFGBuilder took 4498.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 905.6 MB in the end (delta: 179.4 MB). Peak memory consumption was 179.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:20:45,238 INFO L168 Benchmark]: TraceAbstraction took 619314.79 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.6 MB). Free memory was 905.6 MB in the beginning and 764.8 MB in the end (delta: 140.8 MB). Peak memory consumption was 116.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:20:45,238 INFO L168 Benchmark]: Witness Printer took 131.67 ms. Allocated memory is still 1.1 GB. Free memory was 764.8 MB in the beginning and 746.2 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:20:45,239 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.20 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 1225.47 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 780.1 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 226.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 780.1 MB in the beginning and 1.1 GB in the end (delta: -311.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4498.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 905.6 MB in the end (delta: 179.4 MB). Peak memory consumption was 179.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 619314.79 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.6 MB). Free memory was 905.6 MB in the beginning and 764.8 MB in the end (delta: 140.8 MB). Peak memory consumption was 116.2 MB. Max. memory is 11.5 GB. * Witness Printer took 131.67 ms. Allocated memory is still 1.1 GB. Free memory was 764.8 MB in the beginning and 746.2 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 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, 619.2s OverallTime, 128 OverallIterations, 8 TraceHistogramMax, 403.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, 366.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20633 GetRequests, 19779 SyntacticMatches, 4 SemanticMatches, 850 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 13.3s 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: 6.7s AutomataMinimizationTime, 127 MinimizatonAttempts, 22610 StatesRemovedByMinimization, 125 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 6.1s SsaConstructionTime, 127.6s SatisfiabilityAnalysisTime, 63.9s 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...