./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2022a41801b102600c4bc475b4f1b54abdd4798f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2022a41801b102600c4bc475b4f1b54abdd4798f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-678e011 [2019-11-20 05:00:14,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:00:14,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:00:14,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:00:14,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:00:14,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:00:14,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:00:14,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:00:14,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:00:14,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:00:14,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:00:14,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:00:14,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:00:14,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:00:14,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:00:14,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:00:14,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:00:14,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:00:14,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:00:14,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:00:14,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:00:14,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:00:14,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:00:14,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:00:14,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:00:14,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:00:14,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:00:14,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:00:14,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:00:14,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:00:14,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:00:14,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:00:14,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:00:14,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:00:14,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:00:14,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:00:14,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:00:14,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:00:14,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:00:14,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:00:14,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:00:14,852 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:00:14,875 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:00:14,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:00:14,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:00:14,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:00:14,886 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:00:14,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:00:14,886 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:00:14,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:00:14,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:00:14,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:00:14,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:00:14,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:00:14,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:00:14,888 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:00:14,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:00:14,889 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:00:14,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:00:14,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:00:14,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:00:14,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:00:14,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:00:14,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:00:14,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:00:14,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:00:14,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:00:14,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:00:14,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:00:14,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:00:14,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer 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 -> Automizer 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 -> 2022a41801b102600c4bc475b4f1b54abdd4798f [2019-11-20 05:00:15,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:00:15,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:00:15,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:00:15,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:00:15,036 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:00:15,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-11-20 05:00:15,084 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data/aff0e473c/e82463c00fb248d3975338bf8c53d8e1/FLAG9053d488a [2019-11-20 05:00:15,661 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:00:15,662 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-11-20 05:00:15,686 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data/aff0e473c/e82463c00fb248d3975338bf8c53d8e1/FLAG9053d488a [2019-11-20 05:00:16,104 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data/aff0e473c/e82463c00fb248d3975338bf8c53d8e1 [2019-11-20 05:00:16,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:00:16,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:00:16,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:00:16,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:00:16,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:00:16,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50efe098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16, skipping insertion in model container [2019-11-20 05:00:16,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:00:16,173 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:00:16,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:00:16,649 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:00:16,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:00:16,773 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:00:16,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16 WrapperNode [2019-11-20 05:00:16,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:00:16,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:00:16,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:00:16,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:00:16,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:00:16,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:00:16,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:00:16,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:00:16,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... [2019-11-20 05:00:16,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:00:16,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:00:16,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:00:16,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:00:16,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/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 [2019-11-20 05:00:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 05:00:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:00:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 05:00:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 05:00:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 05:00:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 05:00:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:00:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:00:17,278 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 05:00:18,262 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 05:00:18,262 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 05:00:18,264 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:00:18,264 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:00:18,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:00:18 BoogieIcfgContainer [2019-11-20 05:00:18,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:00:18,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:00:18,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:00:18,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:00:18,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:00:16" (1/3) ... [2019-11-20 05:00:18,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f0151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:00:18, skipping insertion in model container [2019-11-20 05:00:18,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:00:16" (2/3) ... [2019-11-20 05:00:18,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f0151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:00:18, skipping insertion in model container [2019-11-20 05:00:18,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:00:18" (3/3) ... [2019-11-20 05:00:18,270 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2019-11-20 05:00:18,278 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:00:18,284 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:00:18,293 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:00:18,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:00:18,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:00:18,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:00:18,315 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:00:18,315 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:00:18,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:00:18,315 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:00:18,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:00:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-20 05:00:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:00:18,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:18,341 INFO L410 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] [2019-11-20 05:00:18,341 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:18,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-20 05:00:18,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:18,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885524924] [2019-11-20 05:00:18,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:18,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885524924] [2019-11-20 05:00:18,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:18,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:18,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391411403] [2019-11-20 05:00:18,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:18,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:18,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:18,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:18,651 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-20 05:00:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:19,292 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-20 05:00:19,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:19,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 05:00:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:19,305 INFO L225 Difference]: With dead ends: 323 [2019-11-20 05:00:19,305 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 05:00:19,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 05:00:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-20 05:00:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-20 05:00:19,367 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-20 05:00:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:19,367 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-20 05:00:19,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-20 05:00:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 05:00:19,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:19,372 INFO L410 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] [2019-11-20 05:00:19,372 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:19,373 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-11-20 05:00:19,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:19,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668085654] [2019-11-20 05:00:19,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:19,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668085654] [2019-11-20 05:00:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:19,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:19,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121044299] [2019-11-20 05:00:19,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:19,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:19,551 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-20 05:00:19,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:19,969 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-20 05:00:19,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:19,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-20 05:00:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:19,971 INFO L225 Difference]: With dead ends: 290 [2019-11-20 05:00:19,972 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 05:00:19,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 05:00:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-20 05:00:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-20 05:00:19,984 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-20 05:00:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:19,985 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-20 05:00:19,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-20 05:00:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 05:00:19,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:19,987 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:00:19,987 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:19,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-11-20 05:00:19,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:19,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62236479] [2019-11-20 05:00:19,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:20,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62236479] [2019-11-20 05:00:20,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:20,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:20,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678431837] [2019-11-20 05:00:20,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:20,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:20,142 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-20 05:00:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:20,569 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-20 05:00:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:20,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 05:00:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:20,571 INFO L225 Difference]: With dead ends: 289 [2019-11-20 05:00:20,571 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 05:00:20,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 05:00:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-20 05:00:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-20 05:00:20,582 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-20 05:00:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:20,589 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-20 05:00:20,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-20 05:00:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 05:00:20,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:20,594 INFO L410 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] [2019-11-20 05:00:20,594 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:20,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:20,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-11-20 05:00:20,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:20,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417708247] [2019-11-20 05:00:20,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:20,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417708247] [2019-11-20 05:00:20,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:20,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:20,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991540898] [2019-11-20 05:00:20,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:20,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:20,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:20,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:20,728 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-20 05:00:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:21,090 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-20 05:00:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:21,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 05:00:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:21,093 INFO L225 Difference]: With dead ends: 287 [2019-11-20 05:00:21,093 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 05:00:21,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 05:00:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-20 05:00:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-20 05:00:21,102 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-20 05:00:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:21,102 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-20 05:00:21,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-20 05:00:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 05:00:21,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:21,105 INFO L410 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] [2019-11-20 05:00:21,105 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-11-20 05:00:21,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:21,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784291203] [2019-11-20 05:00:21,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:21,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784291203] [2019-11-20 05:00:21,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:21,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:21,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977259236] [2019-11-20 05:00:21,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:21,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:21,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:21,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:21,172 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-20 05:00:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:21,505 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-20 05:00:21,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:21,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 05:00:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:21,507 INFO L225 Difference]: With dead ends: 286 [2019-11-20 05:00:21,507 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 05:00:21,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 05:00:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 05:00:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-20 05:00:21,514 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-20 05:00:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:21,515 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-20 05:00:21,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-20 05:00:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 05:00:21,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:21,516 INFO L410 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] [2019-11-20 05:00:21,516 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:21,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-11-20 05:00:21,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:21,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155292338] [2019-11-20 05:00:21,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:21,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155292338] [2019-11-20 05:00:21,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:21,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:21,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053561550] [2019-11-20 05:00:21,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:21,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:21,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:21,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:21,569 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-20 05:00:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:21,874 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-20 05:00:21,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:21,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 05:00:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:21,876 INFO L225 Difference]: With dead ends: 286 [2019-11-20 05:00:21,876 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 05:00:21,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 05:00:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 05:00:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-20 05:00:21,882 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-20 05:00:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:21,882 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-20 05:00:21,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-20 05:00:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 05:00:21,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:21,884 INFO L410 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] [2019-11-20 05:00:21,884 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-11-20 05:00:21,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:21,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873645036] [2019-11-20 05:00:21,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:21,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873645036] [2019-11-20 05:00:21,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:21,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:21,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412907327] [2019-11-20 05:00:21,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:21,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:21,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:21,963 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-20 05:00:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:22,288 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-20 05:00:22,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:22,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-20 05:00:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:22,290 INFO L225 Difference]: With dead ends: 286 [2019-11-20 05:00:22,290 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 05:00:22,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 05:00:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 05:00:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-20 05:00:22,294 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-20 05:00:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:22,295 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-20 05:00:22,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-20 05:00:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 05:00:22,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:22,296 INFO L410 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] [2019-11-20 05:00:22,296 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-11-20 05:00:22,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:22,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850042589] [2019-11-20 05:00:22,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:22,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850042589] [2019-11-20 05:00:22,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:22,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:22,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164178894] [2019-11-20 05:00:22,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:22,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:22,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:22,352 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-20 05:00:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:22,629 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-20 05:00:22,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:22,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-20 05:00:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:22,631 INFO L225 Difference]: With dead ends: 286 [2019-11-20 05:00:22,631 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 05:00:22,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 05:00:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 05:00:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-20 05:00:22,636 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-20 05:00:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:22,636 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-20 05:00:22,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-20 05:00:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 05:00:22,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:22,637 INFO L410 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] [2019-11-20 05:00:22,637 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:22,638 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-11-20 05:00:22,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:22,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132868615] [2019-11-20 05:00:22,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:22,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132868615] [2019-11-20 05:00:22,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:22,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:22,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525395029] [2019-11-20 05:00:22,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:22,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:22,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:22,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:22,690 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-20 05:00:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:22,981 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-20 05:00:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:22,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 05:00:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:22,983 INFO L225 Difference]: With dead ends: 276 [2019-11-20 05:00:22,983 INFO L226 Difference]: Without dead ends: 149 [2019-11-20 05:00:22,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:22,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-20 05:00:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-20 05:00:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 05:00:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-20 05:00:22,988 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-20 05:00:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:22,988 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-20 05:00:22,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-20 05:00:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 05:00:22,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:22,989 INFO L410 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] [2019-11-20 05:00:22,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:22,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-11-20 05:00:22,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:22,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735373550] [2019-11-20 05:00:22,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:23,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735373550] [2019-11-20 05:00:23,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:23,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:23,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401486657] [2019-11-20 05:00:23,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:23,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:23,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:23,083 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-20 05:00:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:23,476 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-20 05:00:23,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:23,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 05:00:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:23,479 INFO L225 Difference]: With dead ends: 316 [2019-11-20 05:00:23,479 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 05:00:23,479 INFO L630 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 [2019-11-20 05:00:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 05:00:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-20 05:00:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-20 05:00:23,491 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-20 05:00:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:23,492 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-20 05:00:23,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-20 05:00:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 05:00:23,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:23,493 INFO L410 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] [2019-11-20 05:00:23,493 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:23,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-11-20 05:00:23,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:23,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492991182] [2019-11-20 05:00:23,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:23,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492991182] [2019-11-20 05:00:23,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:23,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:23,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811869446] [2019-11-20 05:00:23,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:23,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:23,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:23,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:23,554 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-20 05:00:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:23,924 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-20 05:00:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:23,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-20 05:00:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:23,927 INFO L225 Difference]: With dead ends: 338 [2019-11-20 05:00:23,927 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 05:00:23,927 INFO L630 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 [2019-11-20 05:00:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 05:00:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-20 05:00:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-20 05:00:23,933 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-20 05:00:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:23,934 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-20 05:00:23,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-20 05:00:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 05:00:23,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:23,935 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:23,935 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:23,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-11-20 05:00:23,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:23,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798954127] [2019-11-20 05:00:23,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:24,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798954127] [2019-11-20 05:00:24,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:24,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:24,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987383943] [2019-11-20 05:00:24,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:24,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:24,009 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-20 05:00:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:24,440 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-20 05:00:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:24,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 05:00:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:24,442 INFO L225 Difference]: With dead ends: 337 [2019-11-20 05:00:24,442 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 05:00:24,443 INFO L630 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 [2019-11-20 05:00:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 05:00:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-20 05:00:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-20 05:00:24,448 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-20 05:00:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:24,448 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-20 05:00:24,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-20 05:00:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 05:00:24,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:24,450 INFO L410 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] [2019-11-20 05:00:24,451 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:24,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:24,451 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-11-20 05:00:24,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:24,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197507168] [2019-11-20 05:00:24,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:24,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197507168] [2019-11-20 05:00:24,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:24,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:24,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655428222] [2019-11-20 05:00:24,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:24,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:24,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:24,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:24,510 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-20 05:00:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:24,878 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-20 05:00:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:24,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 05:00:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:24,880 INFO L225 Difference]: With dead ends: 335 [2019-11-20 05:00:24,880 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 05:00:24,881 INFO L630 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 [2019-11-20 05:00:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 05:00:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-20 05:00:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-20 05:00:24,886 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-20 05:00:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:24,886 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-20 05:00:24,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-20 05:00:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 05:00:24,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:24,887 INFO L410 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] [2019-11-20 05:00:24,887 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-11-20 05:00:24,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:24,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898826162] [2019-11-20 05:00:24,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:24,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898826162] [2019-11-20 05:00:24,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:24,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:24,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143603118] [2019-11-20 05:00:24,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:24,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:24,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:24,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:24,937 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-20 05:00:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:25,298 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-20 05:00:25,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:25,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 05:00:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:25,300 INFO L225 Difference]: With dead ends: 334 [2019-11-20 05:00:25,300 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 05:00:25,301 INFO L630 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 [2019-11-20 05:00:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 05:00:25,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 05:00:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-20 05:00:25,306 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-20 05:00:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:25,306 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-20 05:00:25,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-20 05:00:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 05:00:25,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:25,307 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:25,307 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:25,307 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-11-20 05:00:25,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:25,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342172139] [2019-11-20 05:00:25,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:25,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342172139] [2019-11-20 05:00:25,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:25,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:25,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958505797] [2019-11-20 05:00:25,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:25,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:25,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:25,352 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-20 05:00:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:25,727 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-20 05:00:25,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:25,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 05:00:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:25,729 INFO L225 Difference]: With dead ends: 334 [2019-11-20 05:00:25,729 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 05:00:25,730 INFO L630 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 [2019-11-20 05:00:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 05:00:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 05:00:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-20 05:00:25,735 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-20 05:00:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:25,735 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-20 05:00:25,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-20 05:00:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 05:00:25,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:25,736 INFO L410 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] [2019-11-20 05:00:25,736 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:25,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-11-20 05:00:25,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:25,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540457262] [2019-11-20 05:00:25,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:25,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540457262] [2019-11-20 05:00:25,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:25,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:25,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340973871] [2019-11-20 05:00:25,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:25,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:25,775 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-20 05:00:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:26,126 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-20 05:00:26,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:26,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-20 05:00:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:26,128 INFO L225 Difference]: With dead ends: 334 [2019-11-20 05:00:26,129 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 05:00:26,129 INFO L630 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 [2019-11-20 05:00:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 05:00:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 05:00:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-20 05:00:26,134 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-20 05:00:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:26,134 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-20 05:00:26,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-20 05:00:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 05:00:26,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:26,135 INFO L410 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] [2019-11-20 05:00:26,135 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-11-20 05:00:26,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:26,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856883971] [2019-11-20 05:00:26,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:26,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856883971] [2019-11-20 05:00:26,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:26,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:26,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137030334] [2019-11-20 05:00:26,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:26,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:26,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:26,197 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-20 05:00:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:26,561 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-20 05:00:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:26,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-20 05:00:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:26,565 INFO L225 Difference]: With dead ends: 334 [2019-11-20 05:00:26,565 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 05:00:26,566 INFO L630 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 [2019-11-20 05:00:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 05:00:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 05:00:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-20 05:00:26,570 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-20 05:00:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:26,571 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-20 05:00:26,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-20 05:00:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 05:00:26,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:26,572 INFO L410 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] [2019-11-20 05:00:26,572 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-11-20 05:00:26,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:26,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228934626] [2019-11-20 05:00:26,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:00:26,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228934626] [2019-11-20 05:00:26,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:26,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:26,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059622055] [2019-11-20 05:00:26,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:26,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:26,635 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-20 05:00:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:26,974 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-20 05:00:26,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:26,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-20 05:00:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:26,976 INFO L225 Difference]: With dead ends: 324 [2019-11-20 05:00:26,976 INFO L226 Difference]: Without dead ends: 175 [2019-11-20 05:00:26,977 INFO L630 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 [2019-11-20 05:00:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-20 05:00:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-20 05:00:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 05:00:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-20 05:00:26,982 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-20 05:00:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:26,983 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-20 05:00:26,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-20 05:00:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 05:00:26,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:26,985 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:26,985 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:26,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:26,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-11-20 05:00:26,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:26,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486984789] [2019-11-20 05:00:26,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:27,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486984789] [2019-11-20 05:00:27,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:27,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:27,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548662711] [2019-11-20 05:00:27,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:27,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:27,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:27,058 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-20 05:00:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:27,574 INFO L93 Difference]: Finished difference Result 422 states and 635 transitions. [2019-11-20 05:00:27,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:27,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 05:00:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:27,576 INFO L225 Difference]: With dead ends: 422 [2019-11-20 05:00:27,576 INFO L226 Difference]: Without dead ends: 273 [2019-11-20 05:00:27,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-20 05:00:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2019-11-20 05:00:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-20 05:00:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-20 05:00:27,583 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-20 05:00:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:27,584 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-20 05:00:27,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-20 05:00:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 05:00:27,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:27,585 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:27,585 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-11-20 05:00:27,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:27,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585038856] [2019-11-20 05:00:27,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:27,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585038856] [2019-11-20 05:00:27,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:27,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:27,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951324616] [2019-11-20 05:00:27,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:27,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:27,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:27,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:27,654 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-20 05:00:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:27,969 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-20 05:00:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:27,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 05:00:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:27,971 INFO L225 Difference]: With dead ends: 427 [2019-11-20 05:00:27,971 INFO L226 Difference]: Without dead ends: 248 [2019-11-20 05:00:27,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-20 05:00:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-20 05:00:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-20 05:00:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-20 05:00:27,980 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-20 05:00:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:27,981 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-20 05:00:27,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-20 05:00:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 05:00:27,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:27,983 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:27,983 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-11-20 05:00:27,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:27,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332000993] [2019-11-20 05:00:27,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:28,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332000993] [2019-11-20 05:00:28,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:28,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:28,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500654168] [2019-11-20 05:00:28,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:28,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:28,086 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-20 05:00:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:28,577 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-11-20 05:00:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:28,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 05:00:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:28,580 INFO L225 Difference]: With dead ends: 492 [2019-11-20 05:00:28,580 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 05:00:28,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 05:00:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2019-11-20 05:00:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-20 05:00:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-20 05:00:28,588 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-20 05:00:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:28,588 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-20 05:00:28,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-20 05:00:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 05:00:28,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:28,590 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:28,590 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-11-20 05:00:28,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:28,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210498568] [2019-11-20 05:00:28,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:28,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210498568] [2019-11-20 05:00:28,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:28,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:28,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346795671] [2019-11-20 05:00:28,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:28,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:28,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:28,669 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-20 05:00:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:29,171 INFO L93 Difference]: Finished difference Result 493 states and 757 transitions. [2019-11-20 05:00:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:29,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-20 05:00:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:29,174 INFO L225 Difference]: With dead ends: 493 [2019-11-20 05:00:29,174 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 05:00:29,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 05:00:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2019-11-20 05:00:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-20 05:00:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-20 05:00:29,182 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-20 05:00:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:29,183 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-20 05:00:29,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-20 05:00:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:00:29,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:29,185 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:29,185 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-11-20 05:00:29,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:29,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507771077] [2019-11-20 05:00:29,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:29,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507771077] [2019-11-20 05:00:29,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:29,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:29,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716741713] [2019-11-20 05:00:29,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:29,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:29,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:29,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:29,249 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-20 05:00:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:29,711 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-11-20 05:00:29,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:29,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-20 05:00:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:29,713 INFO L225 Difference]: With dead ends: 497 [2019-11-20 05:00:29,713 INFO L226 Difference]: Without dead ends: 283 [2019-11-20 05:00:29,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-20 05:00:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-20 05:00:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 05:00:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-20 05:00:29,721 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-20 05:00:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:29,721 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-20 05:00:29,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-20 05:00:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 05:00:29,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:29,722 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:00:29,723 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-11-20 05:00:29,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:29,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177106681] [2019-11-20 05:00:29,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:29,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177106681] [2019-11-20 05:00:29,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:29,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:29,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258311875] [2019-11-20 05:00:29,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:29,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:29,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:29,780 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-20 05:00:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:30,263 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-11-20 05:00:30,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:30,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 05:00:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:30,266 INFO L225 Difference]: With dead ends: 498 [2019-11-20 05:00:30,266 INFO L226 Difference]: Without dead ends: 283 [2019-11-20 05:00:30,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-20 05:00:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-20 05:00:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 05:00:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-20 05:00:30,274 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-20 05:00:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:30,274 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-20 05:00:30,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-20 05:00:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 05:00:30,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:30,276 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:00:30,276 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-11-20 05:00:30,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:30,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987257697] [2019-11-20 05:00:30,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:30,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987257697] [2019-11-20 05:00:30,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:30,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:30,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942544657] [2019-11-20 05:00:30,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:30,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:30,334 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-20 05:00:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:30,736 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-20 05:00:30,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:30,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 05:00:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:30,738 INFO L225 Difference]: With dead ends: 475 [2019-11-20 05:00:30,738 INFO L226 Difference]: Without dead ends: 260 [2019-11-20 05:00:30,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-20 05:00:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-20 05:00:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 05:00:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-20 05:00:30,745 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-20 05:00:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:30,745 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-20 05:00:30,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-20 05:00:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 05:00:30,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:30,747 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-20 05:00:30,747 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-11-20 05:00:30,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:30,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392456574] [2019-11-20 05:00:30,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:30,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392456574] [2019-11-20 05:00:30,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:30,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:30,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571504605] [2019-11-20 05:00:30,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:30,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:30,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:30,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:30,807 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-20 05:00:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:31,277 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-20 05:00:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:31,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 05:00:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:31,279 INFO L225 Difference]: With dead ends: 497 [2019-11-20 05:00:31,279 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 05:00:31,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 05:00:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-20 05:00:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 05:00:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-20 05:00:31,287 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-20 05:00:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:31,287 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-20 05:00:31,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-20 05:00:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 05:00:31,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:31,289 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:00:31,289 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-11-20 05:00:31,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:31,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613694035] [2019-11-20 05:00:31,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:31,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613694035] [2019-11-20 05:00:31,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:31,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:31,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924601680] [2019-11-20 05:00:31,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:31,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:31,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:31,343 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-20 05:00:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:31,831 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-11-20 05:00:31,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:31,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 05:00:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:31,833 INFO L225 Difference]: With dead ends: 495 [2019-11-20 05:00:31,833 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 05:00:31,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 05:00:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-11-20 05:00:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 05:00:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-20 05:00:31,840 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-20 05:00:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:31,840 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-20 05:00:31,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-20 05:00:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 05:00:31,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:31,842 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:00:31,842 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:31,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-11-20 05:00:31,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:31,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527853403] [2019-11-20 05:00:31,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:31,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527853403] [2019-11-20 05:00:31,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:31,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:31,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909637093] [2019-11-20 05:00:31,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:31,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:31,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:31,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:31,905 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-20 05:00:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:32,334 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-11-20 05:00:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:32,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 05:00:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:32,336 INFO L225 Difference]: With dead ends: 494 [2019-11-20 05:00:32,336 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 05:00:32,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 05:00:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-11-20 05:00:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 05:00:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-20 05:00:32,343 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-20 05:00:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:32,343 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-20 05:00:32,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-20 05:00:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 05:00:32,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:32,344 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:32,344 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-11-20 05:00:32,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:32,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142821876] [2019-11-20 05:00:32,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 05:00:32,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142821876] [2019-11-20 05:00:32,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:32,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:00:32,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031119519] [2019-11-20 05:00:32,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:00:32,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:32,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:00:32,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:32,418 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-20 05:00:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:32,931 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-20 05:00:32,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:00:32,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-20 05:00:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:32,934 INFO L225 Difference]: With dead ends: 470 [2019-11-20 05:00:32,934 INFO L226 Difference]: Without dead ends: 255 [2019-11-20 05:00:32,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:00:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-20 05:00:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-20 05:00:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-20 05:00:32,941 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-20 05:00:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:32,942 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-20 05:00:32,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:00:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-20 05:00:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 05:00:32,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:32,943 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:00:32,943 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-11-20 05:00:32,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:32,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879156777] [2019-11-20 05:00:32,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:33,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879156777] [2019-11-20 05:00:33,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:33,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:33,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405278227] [2019-11-20 05:00:33,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:33,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:33,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:33,004 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-20 05:00:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:33,375 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-20 05:00:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:33,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 05:00:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:33,378 INFO L225 Difference]: With dead ends: 512 [2019-11-20 05:00:33,378 INFO L226 Difference]: Without dead ends: 277 [2019-11-20 05:00:33,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-20 05:00:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-20 05:00:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-20 05:00:33,387 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-20 05:00:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:33,387 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-20 05:00:33,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-20 05:00:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 05:00:33,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:33,389 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 05:00:33,389 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-11-20 05:00:33,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:33,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863511021] [2019-11-20 05:00:33,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:33,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863511021] [2019-11-20 05:00:33,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:33,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:33,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274810734] [2019-11-20 05:00:33,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:33,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:33,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:33,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:33,444 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-20 05:00:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:33,832 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-20 05:00:33,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:33,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 05:00:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:33,834 INFO L225 Difference]: With dead ends: 511 [2019-11-20 05:00:33,834 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 05:00:33,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 05:00:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 05:00:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-20 05:00:33,841 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-20 05:00:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:33,842 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-20 05:00:33,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-20 05:00:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 05:00:33,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:33,843 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:33,844 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-11-20 05:00:33,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:33,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886078452] [2019-11-20 05:00:33,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:33,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886078452] [2019-11-20 05:00:33,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:33,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:33,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307002262] [2019-11-20 05:00:33,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:33,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:33,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:33,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:33,907 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-20 05:00:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:34,335 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-11-20 05:00:34,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:34,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 05:00:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:34,338 INFO L225 Difference]: With dead ends: 534 [2019-11-20 05:00:34,338 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 05:00:34,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 05:00:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-20 05:00:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-20 05:00:34,347 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-20 05:00:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:34,348 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-20 05:00:34,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-20 05:00:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 05:00:34,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:34,349 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:34,349 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-11-20 05:00:34,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:34,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54555213] [2019-11-20 05:00:34,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:34,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54555213] [2019-11-20 05:00:34,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:34,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:34,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545997598] [2019-11-20 05:00:34,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:34,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:34,403 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-20 05:00:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:34,788 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-20 05:00:34,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:34,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 05:00:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:34,790 INFO L225 Difference]: With dead ends: 511 [2019-11-20 05:00:34,790 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 05:00:34,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 05:00:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 05:00:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-20 05:00:34,798 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-20 05:00:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:34,798 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-20 05:00:34,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-20 05:00:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 05:00:34,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:34,800 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:34,800 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-11-20 05:00:34,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:34,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538831149] [2019-11-20 05:00:34,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:34,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538831149] [2019-11-20 05:00:34,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:34,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:34,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564577632] [2019-11-20 05:00:34,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:34,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:34,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:34,852 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-20 05:00:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:35,299 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-11-20 05:00:35,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:35,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 05:00:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:35,302 INFO L225 Difference]: With dead ends: 534 [2019-11-20 05:00:35,302 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 05:00:35,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 05:00:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-20 05:00:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-20 05:00:35,310 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-20 05:00:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:35,310 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-20 05:00:35,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-20 05:00:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 05:00:35,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:35,312 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:35,312 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:35,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:35,312 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-11-20 05:00:35,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:35,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042883094] [2019-11-20 05:00:35,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:35,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042883094] [2019-11-20 05:00:35,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:35,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:35,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644851799] [2019-11-20 05:00:35,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:35,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:35,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:35,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:35,373 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-20 05:00:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:35,680 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-20 05:00:35,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:35,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 05:00:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:35,682 INFO L225 Difference]: With dead ends: 511 [2019-11-20 05:00:35,682 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 05:00:35,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 05:00:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 05:00:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-20 05:00:35,690 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-20 05:00:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:35,691 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-20 05:00:35,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-20 05:00:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 05:00:35,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:35,692 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:35,693 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-11-20 05:00:35,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:35,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39993997] [2019-11-20 05:00:35,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:35,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39993997] [2019-11-20 05:00:35,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:35,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:35,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604082237] [2019-11-20 05:00:35,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:35,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:35,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:35,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:35,751 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-20 05:00:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:36,198 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-11-20 05:00:36,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:36,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 05:00:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:36,200 INFO L225 Difference]: With dead ends: 534 [2019-11-20 05:00:36,201 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 05:00:36,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 05:00:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-20 05:00:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-20 05:00:36,209 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-20 05:00:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:36,209 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-20 05:00:36,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-20 05:00:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 05:00:36,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:36,210 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:36,210 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:36,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-11-20 05:00:36,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:36,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313711503] [2019-11-20 05:00:36,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:36,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313711503] [2019-11-20 05:00:36,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:36,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:36,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50948794] [2019-11-20 05:00:36,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:36,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:36,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:36,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:36,271 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-20 05:00:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:36,631 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-20 05:00:36,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:36,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 05:00:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:36,633 INFO L225 Difference]: With dead ends: 511 [2019-11-20 05:00:36,633 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 05:00:36,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 05:00:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 05:00:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-20 05:00:36,642 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-20 05:00:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:36,642 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-20 05:00:36,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-20 05:00:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 05:00:36,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:36,644 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:36,644 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-11-20 05:00:36,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:36,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622237839] [2019-11-20 05:00:36,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:36,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622237839] [2019-11-20 05:00:36,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:36,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:36,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840921407] [2019-11-20 05:00:36,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:36,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:36,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:36,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:36,706 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-20 05:00:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:37,118 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-11-20 05:00:37,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:37,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 05:00:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:37,120 INFO L225 Difference]: With dead ends: 524 [2019-11-20 05:00:37,120 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 05:00:37,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 05:00:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-20 05:00:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-20 05:00:37,128 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-20 05:00:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:37,128 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-20 05:00:37,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-20 05:00:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 05:00:37,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:37,129 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:37,130 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-11-20 05:00:37,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:37,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713568957] [2019-11-20 05:00:37,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:37,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713568957] [2019-11-20 05:00:37,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:37,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:37,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298662409] [2019-11-20 05:00:37,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:37,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:37,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:37,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:37,184 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-20 05:00:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:37,457 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-20 05:00:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:37,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 05:00:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:37,462 INFO L225 Difference]: With dead ends: 501 [2019-11-20 05:00:37,462 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 05:00:37,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 05:00:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-20 05:00:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-20 05:00:37,471 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-20 05:00:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:37,471 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-20 05:00:37,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-20 05:00:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 05:00:37,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:37,473 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:37,473 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-11-20 05:00:37,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:37,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844809636] [2019-11-20 05:00:37,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:00:37,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844809636] [2019-11-20 05:00:37,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:37,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:37,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444280538] [2019-11-20 05:00:37,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:37,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:37,534 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-20 05:00:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:37,902 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-11-20 05:00:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:37,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 05:00:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:37,904 INFO L225 Difference]: With dead ends: 524 [2019-11-20 05:00:37,904 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 05:00:37,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 05:00:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-20 05:00:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 05:00:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-20 05:00:37,917 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-20 05:00:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:37,918 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-20 05:00:37,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-20 05:00:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 05:00:37,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:37,919 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:37,919 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-11-20 05:00:37,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:37,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146223422] [2019-11-20 05:00:37,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 05:00:37,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146223422] [2019-11-20 05:00:37,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:37,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:00:37,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889853778] [2019-11-20 05:00:37,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:00:37,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:00:37,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:00:37,979 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-20 05:00:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:38,037 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-20 05:00:38,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:00:38,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 05:00:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:38,040 INFO L225 Difference]: With dead ends: 722 [2019-11-20 05:00:38,040 INFO L226 Difference]: Without dead ends: 487 [2019-11-20 05:00:38,040 INFO L630 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 [2019-11-20 05:00:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-20 05:00:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-20 05:00:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-20 05:00:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-20 05:00:38,057 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-20 05:00:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:38,057 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-20 05:00:38,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:00:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-20 05:00:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 05:00:38,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:38,059 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:38,059 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-11-20 05:00:38,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:38,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549152682] [2019-11-20 05:00:38,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:00:38,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549152682] [2019-11-20 05:00:38,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:38,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:00:38,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311985718] [2019-11-20 05:00:38,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:00:38,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:38,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:00:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:00:38,112 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-20 05:00:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:38,172 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-20 05:00:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:00:38,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 05:00:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:38,176 INFO L225 Difference]: With dead ends: 1190 [2019-11-20 05:00:38,176 INFO L226 Difference]: Without dead ends: 722 [2019-11-20 05:00:38,177 INFO L630 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 [2019-11-20 05:00:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-20 05:00:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-20 05:00:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-20 05:00:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-20 05:00:38,198 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-20 05:00:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:38,198 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-20 05:00:38,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:00:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-20 05:00:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 05:00:38,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:38,200 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:38,200 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-11-20 05:00:38,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:38,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782703802] [2019-11-20 05:00:38,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:00:38,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782703802] [2019-11-20 05:00:38,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:38,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:00:38,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264796320] [2019-11-20 05:00:38,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:00:38,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:00:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:00:38,259 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-20 05:00:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:38,353 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-20 05:00:38,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:00:38,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 05:00:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:38,358 INFO L225 Difference]: With dead ends: 1656 [2019-11-20 05:00:38,358 INFO L226 Difference]: Without dead ends: 955 [2019-11-20 05:00:38,359 INFO L630 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 [2019-11-20 05:00:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-20 05:00:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-20 05:00:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-20 05:00:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-20 05:00:38,390 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-20 05:00:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:38,391 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-20 05:00:38,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:00:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-20 05:00:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 05:00:38,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:38,393 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:38,394 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:38,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2010094734, now seen corresponding path program 1 times [2019-11-20 05:00:38,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:38,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862387669] [2019-11-20 05:00:38,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:00:38,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862387669] [2019-11-20 05:00:38,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:38,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:00:38,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27708695] [2019-11-20 05:00:38,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:00:38,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:00:38,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:00:38,457 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-20 05:00:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:38,527 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-20 05:00:38,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:00:38,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 05:00:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:38,534 INFO L225 Difference]: With dead ends: 2120 [2019-11-20 05:00:38,534 INFO L226 Difference]: Without dead ends: 1186 [2019-11-20 05:00:38,535 INFO L630 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 [2019-11-20 05:00:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-20 05:00:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-20 05:00:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-20 05:00:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-20 05:00:38,569 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-20 05:00:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:38,569 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-20 05:00:38,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:00:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-20 05:00:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 05:00:38,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:38,572 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:00:38,572 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:38,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:38,573 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-11-20 05:00:38,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:38,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103397237] [2019-11-20 05:00:38,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 05:00:38,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103397237] [2019-11-20 05:00:38,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:38,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:00:38,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873829676] [2019-11-20 05:00:38,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:00:38,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:38,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:00:38,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:00:38,676 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-20 05:00:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:38,742 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-20 05:00:38,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:00:38,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-20 05:00:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:38,749 INFO L225 Difference]: With dead ends: 1423 [2019-11-20 05:00:38,749 INFO L226 Difference]: Without dead ends: 1421 [2019-11-20 05:00:38,750 INFO L630 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 [2019-11-20 05:00:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-20 05:00:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-20 05:00:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-20 05:00:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-20 05:00:38,792 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-20 05:00:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:38,793 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-20 05:00:38,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:00:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-20 05:00:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 05:00:38,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:38,797 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:00:38,798 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:38,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-11-20 05:00:38,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:38,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463364127] [2019-11-20 05:00:38,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:00:39,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463364127] [2019-11-20 05:00:39,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529669412] [2019-11-20 05:00:39,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:00:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:39,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 05:00:39,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:00:39,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:39,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 05:00:39,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:39,598 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-20 05:00:39,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 05:00:39,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:39,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:39,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 05:00:39,706 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:39,781 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 05:00:39,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 05:00:39,782 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:39,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,800 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 05:00:39,864 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 05:00:39,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:00:39,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:39,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 05:00:39,944 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 05:00:39,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:00:39,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:39,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:00:39,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 05:00:39,961 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-20 05:00:39,966 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:00:39,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:40,059 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 05:00:40,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 05:00:40,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:40,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:40,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:00:40,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 05:00:40,138 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 05:00:40,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:00:40,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:40,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:40,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:00:40,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 05:00:40,194 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 05:00:40,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:00:40,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:40,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:40,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:00:40,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 05:00:40,225 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-11-20 05:00:40,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:40,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 05:00:40,233 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:00:40,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:40,461 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-11-20 05:00:40,461 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-20 05:00:40,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 05:00:40,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:40,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:40,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:41,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:41,138 INFO L496 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 3 xjuncts. [2019-11-20 05:00:42,623 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-11-20 05:00:42,624 INFO L567 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-11-20 05:00:42,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:42,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 05:00:42,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:42,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:42,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 3 xjuncts. [2019-11-20 05:00:42,660 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-11-20 05:00:43,062 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-11-20 05:00:43,108 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-11-20 05:00:43,111 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:00:43,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:43,384 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-11-20 05:00:43,385 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-20 05:00:43,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-11-20 05:00:43,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:43,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:43,435 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-20 05:00:43,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:00:43,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-20 05:00:44,379 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-11-20 05:00:44,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-11-20 05:00:44,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:44,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:44,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,639 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-20 05:00:44,639 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-11-20 05:00:44,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2019-11-20 05:00:44,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:44,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:44,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:44,836 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 40 [2019-11-20 05:00:44,837 INFO L567 ElimStorePlain]: treesize reduction 7053, result has 1.2 percent of original size [2019-11-20 05:00:44,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:00:44,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-11-20 05:00:44,888 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-11-20 05:00:44,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 25 [2019-11-20 05:00:44,893 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:00:44,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:44,919 INFO L377 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 35 treesize of output 28 [2019-11-20 05:00:44,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:44,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:44,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:00:44,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:44,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-20 05:00:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:44,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:45,107 INFO L496 ElimStorePlain]: Start of recursive call 4: 150 dim-0 vars, End of recursive call: 151 dim-0 vars, and 14 xjuncts. [2019-11-20 05:00:50,979 WARN L191 SmtUtils]: Spent 5.87 s on a formula simplification. DAG size of input: 1094 DAG size of output: 1034 [2019-11-20 05:00:50,980 INFO L567 ElimStorePlain]: treesize reduction 320, result has 89.6 percent of original size [2019-11-20 05:00:50,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 05:00:50,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:00:50,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:50,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-11-20 05:00:50,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:50,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:00:50,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:50,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 05:00:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:00:51,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 05:00:51,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:00:51,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 05:00:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:00:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:00:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 05:00:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:00:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 05:00:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:00:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 05:00:51,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:00:51,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:00:51,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 262 dim-0 vars, and 1 xjuncts. [2019-11-20 05:00:51,055 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1845 [2019-11-20 05:00:52,365 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 1323 DAG size of output: 22 [2019-11-20 05:00:52,381 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 05:00:52,382 INFO L377 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-20 05:00:52,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:52,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:52,390 INFO L496 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. [2019-11-20 05:00:52,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-11-20 05:00:52,444 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 05:00:52,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-20 05:00:52,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:00:52,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:00:52,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:00:52,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-20 05:00:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:00:52,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:00:52,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-20 05:00:52,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128964829] [2019-11-20 05:00:52,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 05:00:52,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:52,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 05:00:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:00:52,708 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 13 states. [2019-11-20 05:00:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:56,755 INFO L93 Difference]: Finished difference Result 6881 states and 10226 transitions. [2019-11-20 05:00:56,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 05:00:56,760 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-11-20 05:00:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:56,788 INFO L225 Difference]: With dead ends: 6881 [2019-11-20 05:00:56,789 INFO L226 Difference]: Without dead ends: 5481 [2019-11-20 05:00:56,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 120 SyntacticMatches, 46 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-11-20 05:00:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2019-11-20 05:00:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 3081. [2019-11-20 05:00:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-11-20 05:00:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4683 transitions. [2019-11-20 05:00:56,923 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4683 transitions. Word has length 164 [2019-11-20 05:00:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:56,924 INFO L462 AbstractCegarLoop]: Abstraction has 3081 states and 4683 transitions. [2019-11-20 05:00:56,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 05:00:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4683 transitions. [2019-11-20 05:00:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 05:00:56,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:56,931 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:00:57,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:00:57,137 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2019-11-20 05:00:57,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:57,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398237459] [2019-11-20 05:00:57,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 05:00:57,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398237459] [2019-11-20 05:00:57,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:57,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:57,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452717722] [2019-11-20 05:00:57,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:57,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:57,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:57,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:57,233 INFO L87 Difference]: Start difference. First operand 3081 states and 4683 transitions. Second operand 4 states. [2019-11-20 05:00:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:57,669 INFO L93 Difference]: Finished difference Result 6839 states and 10430 transitions. [2019-11-20 05:00:57,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:57,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-20 05:00:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:57,685 INFO L225 Difference]: With dead ends: 6839 [2019-11-20 05:00:57,686 INFO L226 Difference]: Without dead ends: 3777 [2019-11-20 05:00:57,689 INFO L630 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 [2019-11-20 05:00:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2019-11-20 05:00:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3417. [2019-11-20 05:00:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-11-20 05:00:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-11-20 05:00:57,795 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 170 [2019-11-20 05:00:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:57,796 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-11-20 05:00:57,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-11-20 05:00:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 05:00:57,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:57,803 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-11-20 05:00:57,803 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:57,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2019-11-20 05:00:57,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:57,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540739237] [2019-11-20 05:00:57,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-20 05:00:57,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540739237] [2019-11-20 05:00:57,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:57,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:57,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689571] [2019-11-20 05:00:57,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:57,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:57,907 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-11-20 05:00:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:58,656 INFO L93 Difference]: Finished difference Result 7957 states and 12273 transitions. [2019-11-20 05:00:58,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:58,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 05:00:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:58,681 INFO L225 Difference]: With dead ends: 7957 [2019-11-20 05:00:58,687 INFO L226 Difference]: Without dead ends: 4559 [2019-11-20 05:00:58,692 INFO L630 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 [2019-11-20 05:00:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2019-11-20 05:00:58,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 3885. [2019-11-20 05:00:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-11-20 05:00:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6123 transitions. [2019-11-20 05:00:58,868 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6123 transitions. Word has length 178 [2019-11-20 05:00:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:58,868 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6123 transitions. [2019-11-20 05:00:58,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6123 transitions. [2019-11-20 05:00:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 05:00:58,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:58,877 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-20 05:00:58,877 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:58,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:58,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2019-11-20 05:00:58,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:58,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356028870] [2019-11-20 05:00:58,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-20 05:00:58,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356028870] [2019-11-20 05:00:58,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:58,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:00:58,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105020442] [2019-11-20 05:00:58,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:00:58,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:00:58,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:00:58,979 INFO L87 Difference]: Start difference. First operand 3885 states and 6123 transitions. Second operand 4 states. [2019-11-20 05:00:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:00:59,488 INFO L93 Difference]: Finished difference Result 8375 states and 13050 transitions. [2019-11-20 05:00:59,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:00:59,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-20 05:00:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:00:59,497 INFO L225 Difference]: With dead ends: 8375 [2019-11-20 05:00:59,497 INFO L226 Difference]: Without dead ends: 4509 [2019-11-20 05:00:59,501 INFO L630 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 [2019-11-20 05:00:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2019-11-20 05:00:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 3765. [2019-11-20 05:00:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-11-20 05:00:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5895 transitions. [2019-11-20 05:00:59,597 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5895 transitions. Word has length 179 [2019-11-20 05:00:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:00:59,597 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5895 transitions. [2019-11-20 05:00:59,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:00:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5895 transitions. [2019-11-20 05:00:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 05:00:59,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:00:59,603 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:00:59,604 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:00:59,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:00:59,604 INFO L82 PathProgramCache]: Analyzing trace with hash 289713635, now seen corresponding path program 1 times [2019-11-20 05:00:59,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:00:59,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570380144] [2019-11-20 05:00:59,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:00:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:00:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 05:00:59,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570380144] [2019-11-20 05:00:59,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:00:59,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:00:59,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393569580] [2019-11-20 05:00:59,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:00:59,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:00:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:00:59,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:00:59,732 INFO L87 Difference]: Start difference. First operand 3765 states and 5895 transitions. Second operand 5 states. [2019-11-20 05:01:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:00,213 INFO L93 Difference]: Finished difference Result 9025 states and 14137 transitions. [2019-11-20 05:01:00,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:00,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-11-20 05:01:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:00,223 INFO L225 Difference]: With dead ends: 9025 [2019-11-20 05:01:00,223 INFO L226 Difference]: Without dead ends: 5279 [2019-11-20 05:01:00,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:01:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2019-11-20 05:01:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 4239. [2019-11-20 05:01:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-11-20 05:01:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6753 transitions. [2019-11-20 05:01:00,338 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6753 transitions. Word has length 179 [2019-11-20 05:01:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:00,339 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 6753 transitions. [2019-11-20 05:01:00,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:01:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6753 transitions. [2019-11-20 05:01:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 05:01:00,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:00,345 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:01:00,346 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1455825383, now seen corresponding path program 2 times [2019-11-20 05:01:00,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:00,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067920442] [2019-11-20 05:01:00,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 05:01:00,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067920442] [2019-11-20 05:01:00,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:00,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:00,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132659730] [2019-11-20 05:01:00,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:00,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:00,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:00,422 INFO L87 Difference]: Start difference. First operand 4239 states and 6753 transitions. Second operand 4 states. [2019-11-20 05:01:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:00,858 INFO L93 Difference]: Finished difference Result 7555 states and 11938 transitions. [2019-11-20 05:01:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:00,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-20 05:01:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:00,882 INFO L225 Difference]: With dead ends: 7555 [2019-11-20 05:01:00,882 INFO L226 Difference]: Without dead ends: 5381 [2019-11-20 05:01:00,885 INFO L630 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 [2019-11-20 05:01:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-11-20 05:01:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4383. [2019-11-20 05:01:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-20 05:01:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6957 transitions. [2019-11-20 05:01:00,999 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6957 transitions. Word has length 179 [2019-11-20 05:01:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:01,000 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6957 transitions. [2019-11-20 05:01:01,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6957 transitions. [2019-11-20 05:01:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 05:01:01,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:01,010 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:01:01,011 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1317975036, now seen corresponding path program 1 times [2019-11-20 05:01:01,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:01,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038822668] [2019-11-20 05:01:01,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 05:01:01,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038822668] [2019-11-20 05:01:01,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:01,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:01,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263382310] [2019-11-20 05:01:01,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:01,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:01,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:01,097 INFO L87 Difference]: Start difference. First operand 4383 states and 6957 transitions. Second operand 4 states. [2019-11-20 05:01:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:01,810 INFO L93 Difference]: Finished difference Result 7627 states and 12028 transitions. [2019-11-20 05:01:01,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:01,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-20 05:01:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:01,818 INFO L225 Difference]: With dead ends: 7627 [2019-11-20 05:01:01,818 INFO L226 Difference]: Without dead ends: 5381 [2019-11-20 05:01:01,821 INFO L630 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 [2019-11-20 05:01:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-11-20 05:01:01,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4395. [2019-11-20 05:01:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-11-20 05:01:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6969 transitions. [2019-11-20 05:01:01,936 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6969 transitions. Word has length 180 [2019-11-20 05:01:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:01,936 INFO L462 AbstractCegarLoop]: Abstraction has 4395 states and 6969 transitions. [2019-11-20 05:01:01,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6969 transitions. [2019-11-20 05:01:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 05:01:01,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:01,943 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:01:01,943 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:01,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:01,943 INFO L82 PathProgramCache]: Analyzing trace with hash 384150911, now seen corresponding path program 1 times [2019-11-20 05:01:01,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:01,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802660774] [2019-11-20 05:01:01,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 05:01:02,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802660774] [2019-11-20 05:01:02,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:02,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:01:02,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103663481] [2019-11-20 05:01:02,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:01:02,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:01:02,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:01:02,082 INFO L87 Difference]: Start difference. First operand 4395 states and 6969 transitions. Second operand 5 states. [2019-11-20 05:01:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:02,635 INFO L93 Difference]: Finished difference Result 9949 states and 15739 transitions. [2019-11-20 05:01:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:02,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-11-20 05:01:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:02,643 INFO L225 Difference]: With dead ends: 9949 [2019-11-20 05:01:02,643 INFO L226 Difference]: Without dead ends: 5573 [2019-11-20 05:01:02,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:01:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2019-11-20 05:01:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 4263. [2019-11-20 05:01:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-11-20 05:01:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6789 transitions. [2019-11-20 05:01:02,780 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6789 transitions. Word has length 180 [2019-11-20 05:01:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:02,781 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6789 transitions. [2019-11-20 05:01:02,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:01:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6789 transitions. [2019-11-20 05:01:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 05:01:02,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:02,787 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:01:02,787 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:02,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1028551806, now seen corresponding path program 1 times [2019-11-20 05:01:02,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:02,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152818694] [2019-11-20 05:01:02,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 05:01:02,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152818694] [2019-11-20 05:01:02,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:02,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:02,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958587481] [2019-11-20 05:01:02,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:02,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:02,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:02,867 INFO L87 Difference]: Start difference. First operand 4263 states and 6789 transitions. Second operand 4 states. [2019-11-20 05:01:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:03,343 INFO L93 Difference]: Finished difference Result 7385 states and 11677 transitions. [2019-11-20 05:01:03,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:03,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-20 05:01:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:03,348 INFO L225 Difference]: With dead ends: 7385 [2019-11-20 05:01:03,348 INFO L226 Difference]: Without dead ends: 5199 [2019-11-20 05:01:03,350 INFO L630 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 [2019-11-20 05:01:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2019-11-20 05:01:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4275. [2019-11-20 05:01:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-11-20 05:01:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6801 transitions. [2019-11-20 05:01:03,469 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6801 transitions. Word has length 181 [2019-11-20 05:01:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:03,469 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6801 transitions. [2019-11-20 05:01:03,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6801 transitions. [2019-11-20 05:01:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 05:01:03,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:03,475 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:01:03,475 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:03,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1170394039, now seen corresponding path program 1 times [2019-11-20 05:01:03,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:03,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018625643] [2019-11-20 05:01:03,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 05:01:03,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018625643] [2019-11-20 05:01:03,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:03,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:03,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712795584] [2019-11-20 05:01:03,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:03,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:03,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:03,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:03,557 INFO L87 Difference]: Start difference. First operand 4275 states and 6801 transitions. Second operand 4 states. [2019-11-20 05:01:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:04,206 INFO L93 Difference]: Finished difference Result 7331 states and 11599 transitions. [2019-11-20 05:01:04,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:04,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-20 05:01:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:04,210 INFO L225 Difference]: With dead ends: 7331 [2019-11-20 05:01:04,210 INFO L226 Difference]: Without dead ends: 5139 [2019-11-20 05:01:04,215 INFO L630 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 [2019-11-20 05:01:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2019-11-20 05:01:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 4287. [2019-11-20 05:01:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 05:01:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6813 transitions. [2019-11-20 05:01:04,354 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6813 transitions. Word has length 182 [2019-11-20 05:01:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:04,354 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6813 transitions. [2019-11-20 05:01:04,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6813 transitions. [2019-11-20 05:01:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 05:01:04,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:04,358 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:01:04,359 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:04,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2019-11-20 05:01:04,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:04,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234092030] [2019-11-20 05:01:04,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:01:04,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234092030] [2019-11-20 05:01:04,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:04,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:04,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987659175] [2019-11-20 05:01:04,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:04,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:04,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:04,446 INFO L87 Difference]: Start difference. First operand 4287 states and 6813 transitions. Second operand 4 states. [2019-11-20 05:01:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:04,883 INFO L93 Difference]: Finished difference Result 8903 states and 14078 transitions. [2019-11-20 05:01:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:04,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-20 05:01:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:04,887 INFO L225 Difference]: With dead ends: 8903 [2019-11-20 05:01:04,888 INFO L226 Difference]: Without dead ends: 4635 [2019-11-20 05:01:04,891 INFO L630 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 [2019-11-20 05:01:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-20 05:01:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-20 05:01:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 05:01:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6801 transitions. [2019-11-20 05:01:04,977 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6801 transitions. Word has length 184 [2019-11-20 05:01:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:04,978 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6801 transitions. [2019-11-20 05:01:04,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6801 transitions. [2019-11-20 05:01:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 05:01:04,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:04,984 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:01:04,984 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1263023272, now seen corresponding path program 1 times [2019-11-20 05:01:04,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:04,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687011906] [2019-11-20 05:01:04,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:01:05,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687011906] [2019-11-20 05:01:05,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:05,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:05,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507490022] [2019-11-20 05:01:05,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:05,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:05,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:05,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:05,064 INFO L87 Difference]: Start difference. First operand 4287 states and 6801 transitions. Second operand 4 states. [2019-11-20 05:01:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:05,693 INFO L93 Difference]: Finished difference Result 6833 states and 10743 transitions. [2019-11-20 05:01:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:05,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-20 05:01:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:05,698 INFO L225 Difference]: With dead ends: 6833 [2019-11-20 05:01:05,698 INFO L226 Difference]: Without dead ends: 4635 [2019-11-20 05:01:05,702 INFO L630 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 [2019-11-20 05:01:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-20 05:01:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-20 05:01:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 05:01:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6789 transitions. [2019-11-20 05:01:05,824 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6789 transitions. Word has length 185 [2019-11-20 05:01:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:05,824 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6789 transitions. [2019-11-20 05:01:05,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6789 transitions. [2019-11-20 05:01:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 05:01:05,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:05,830 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:01:05,830 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1547746275, now seen corresponding path program 1 times [2019-11-20 05:01:05,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:05,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073206712] [2019-11-20 05:01:05,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:01:05,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073206712] [2019-11-20 05:01:05,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:05,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:05,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847174033] [2019-11-20 05:01:05,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:05,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:05,913 INFO L87 Difference]: Start difference. First operand 4287 states and 6789 transitions. Second operand 4 states. [2019-11-20 05:01:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:06,356 INFO L93 Difference]: Finished difference Result 6833 states and 10725 transitions. [2019-11-20 05:01:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:06,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-20 05:01:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:06,359 INFO L225 Difference]: With dead ends: 6833 [2019-11-20 05:01:06,359 INFO L226 Difference]: Without dead ends: 4635 [2019-11-20 05:01:06,362 INFO L630 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 [2019-11-20 05:01:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-20 05:01:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-20 05:01:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 05:01:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6777 transitions. [2019-11-20 05:01:06,448 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6777 transitions. Word has length 186 [2019-11-20 05:01:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:06,448 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6777 transitions. [2019-11-20 05:01:06,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6777 transitions. [2019-11-20 05:01:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-20 05:01:06,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:06,454 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:01:06,454 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash -619567939, now seen corresponding path program 1 times [2019-11-20 05:01:06,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:06,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049873698] [2019-11-20 05:01:06,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:01:06,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049873698] [2019-11-20 05:01:06,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:06,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:06,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535271725] [2019-11-20 05:01:06,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:06,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:06,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:06,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:06,543 INFO L87 Difference]: Start difference. First operand 4287 states and 6777 transitions. Second operand 4 states. [2019-11-20 05:01:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:06,996 INFO L93 Difference]: Finished difference Result 6833 states and 10707 transitions. [2019-11-20 05:01:06,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:06,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-20 05:01:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:07,001 INFO L225 Difference]: With dead ends: 6833 [2019-11-20 05:01:07,001 INFO L226 Difference]: Without dead ends: 4635 [2019-11-20 05:01:07,003 INFO L630 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 [2019-11-20 05:01:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-20 05:01:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-20 05:01:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 05:01:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6765 transitions. [2019-11-20 05:01:07,107 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6765 transitions. Word has length 187 [2019-11-20 05:01:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:07,107 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6765 transitions. [2019-11-20 05:01:07,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6765 transitions. [2019-11-20 05:01:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 05:01:07,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:07,113 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:01:07,114 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash -746153758, now seen corresponding path program 1 times [2019-11-20 05:01:07,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:07,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532435589] [2019-11-20 05:01:07,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:01:07,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532435589] [2019-11-20 05:01:07,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:07,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:07,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727701670] [2019-11-20 05:01:07,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:07,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:07,276 INFO L87 Difference]: Start difference. First operand 4287 states and 6765 transitions. Second operand 4 states. [2019-11-20 05:01:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:07,689 INFO L93 Difference]: Finished difference Result 6773 states and 10617 transitions. [2019-11-20 05:01:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:07,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-20 05:01:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:07,693 INFO L225 Difference]: With dead ends: 6773 [2019-11-20 05:01:07,693 INFO L226 Difference]: Without dead ends: 4575 [2019-11-20 05:01:07,696 INFO L630 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 [2019-11-20 05:01:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-11-20 05:01:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-11-20 05:01:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 05:01:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-11-20 05:01:07,787 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 188 [2019-11-20 05:01:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:07,787 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-11-20 05:01:07,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-11-20 05:01:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 05:01:07,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:07,791 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-20 05:01:07,791 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:07,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash 791063530, now seen corresponding path program 1 times [2019-11-20 05:01:07,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:07,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160595730] [2019-11-20 05:01:07,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-20 05:01:07,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160595730] [2019-11-20 05:01:07,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:07,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:07,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917634075] [2019-11-20 05:01:07,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:07,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:07,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:07,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:07,875 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-11-20 05:01:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:08,366 INFO L93 Difference]: Finished difference Result 9407 states and 14790 transitions. [2019-11-20 05:01:08,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:08,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-20 05:01:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:08,371 INFO L225 Difference]: With dead ends: 9407 [2019-11-20 05:01:08,371 INFO L226 Difference]: Without dead ends: 5139 [2019-11-20 05:01:08,374 INFO L630 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 [2019-11-20 05:01:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2019-11-20 05:01:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 4299. [2019-11-20 05:01:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-11-20 05:01:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 6765 transitions. [2019-11-20 05:01:08,471 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 6765 transitions. Word has length 192 [2019-11-20 05:01:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:08,471 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 6765 transitions. [2019-11-20 05:01:08,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 6765 transitions. [2019-11-20 05:01:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 05:01:08,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:08,474 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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] [2019-11-20 05:01:08,475 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:08,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:08,475 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2019-11-20 05:01:08,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:08,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288871182] [2019-11-20 05:01:08,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:01:08,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288871182] [2019-11-20 05:01:08,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:08,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:08,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962970695] [2019-11-20 05:01:08,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:08,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:08,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:08,564 INFO L87 Difference]: Start difference. First operand 4299 states and 6765 transitions. Second operand 4 states. [2019-11-20 05:01:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:09,015 INFO L93 Difference]: Finished difference Result 8867 states and 13910 transitions. [2019-11-20 05:01:09,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:09,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-20 05:01:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:09,019 INFO L225 Difference]: With dead ends: 8867 [2019-11-20 05:01:09,019 INFO L226 Difference]: Without dead ends: 4587 [2019-11-20 05:01:09,023 INFO L630 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 [2019-11-20 05:01:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2019-11-20 05:01:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4299. [2019-11-20 05:01:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-11-20 05:01:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 6753 transitions. [2019-11-20 05:01:09,125 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 6753 transitions. Word has length 192 [2019-11-20 05:01:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:09,125 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 6753 transitions. [2019-11-20 05:01:09,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 6753 transitions. [2019-11-20 05:01:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 05:01:09,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:09,128 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:01:09,129 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:09,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash 147913884, now seen corresponding path program 1 times [2019-11-20 05:01:09,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:09,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115126729] [2019-11-20 05:01:09,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:01:09,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115126729] [2019-11-20 05:01:09,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:09,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:09,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433001640] [2019-11-20 05:01:09,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:09,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:09,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:09,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:09,218 INFO L87 Difference]: Start difference. First operand 4299 states and 6753 transitions. Second operand 4 states. [2019-11-20 05:01:09,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:09,653 INFO L93 Difference]: Finished difference Result 8867 states and 13886 transitions. [2019-11-20 05:01:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:09,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-20 05:01:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:09,656 INFO L225 Difference]: With dead ends: 8867 [2019-11-20 05:01:09,656 INFO L226 Difference]: Without dead ends: 4587 [2019-11-20 05:01:09,660 INFO L630 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 [2019-11-20 05:01:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2019-11-20 05:01:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4299. [2019-11-20 05:01:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-11-20 05:01:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 6741 transitions. [2019-11-20 05:01:09,764 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 6741 transitions. Word has length 192 [2019-11-20 05:01:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:09,765 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 6741 transitions. [2019-11-20 05:01:09,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 6741 transitions. [2019-11-20 05:01:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 05:01:09,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:09,768 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-11-20 05:01:09,768 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 323502751, now seen corresponding path program 1 times [2019-11-20 05:01:09,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:09,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083220433] [2019-11-20 05:01:09,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-20 05:01:09,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083220433] [2019-11-20 05:01:09,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:09,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:09,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003302196] [2019-11-20 05:01:09,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:09,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:09,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:09,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:09,851 INFO L87 Difference]: Start difference. First operand 4299 states and 6741 transitions. Second operand 4 states. [2019-11-20 05:01:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:10,628 INFO L93 Difference]: Finished difference Result 9395 states and 14718 transitions. [2019-11-20 05:01:10,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:10,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-20 05:01:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:10,635 INFO L225 Difference]: With dead ends: 9395 [2019-11-20 05:01:10,635 INFO L226 Difference]: Without dead ends: 5115 [2019-11-20 05:01:10,639 INFO L630 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 [2019-11-20 05:01:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2019-11-20 05:01:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 4311. [2019-11-20 05:01:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-11-20 05:01:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 6753 transitions. [2019-11-20 05:01:10,747 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 6753 transitions. Word has length 193 [2019-11-20 05:01:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:10,747 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 6753 transitions. [2019-11-20 05:01:10,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 6753 transitions. [2019-11-20 05:01:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 05:01:10,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:10,751 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2019-11-20 05:01:10,751 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:10,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:10,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1478506975, now seen corresponding path program 1 times [2019-11-20 05:01:10,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:10,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165175375] [2019-11-20 05:01:10,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:01:10,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165175375] [2019-11-20 05:01:10,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:10,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:01:10,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412405112] [2019-11-20 05:01:10,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:10,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:01:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:10,836 INFO L87 Difference]: Start difference. First operand 4311 states and 6753 transitions. Second operand 4 states. [2019-11-20 05:01:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:11,343 INFO L93 Difference]: Finished difference Result 7613 states and 11863 transitions. [2019-11-20 05:01:11,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:11,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-20 05:01:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:11,347 INFO L225 Difference]: With dead ends: 7613 [2019-11-20 05:01:11,348 INFO L226 Difference]: Without dead ends: 5403 [2019-11-20 05:01:11,349 INFO L630 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 [2019-11-20 05:01:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-11-20 05:01:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 4455. [2019-11-20 05:01:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4455 states. [2019-11-20 05:01:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6957 transitions. [2019-11-20 05:01:11,469 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6957 transitions. Word has length 193 [2019-11-20 05:01:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:11,470 INFO L462 AbstractCegarLoop]: Abstraction has 4455 states and 6957 transitions. [2019-11-20 05:01:11,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6957 transitions. [2019-11-20 05:01:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 05:01:11,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:11,473 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:01:11,473 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2019-11-20 05:01:11,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:01:11,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135871081] [2019-11-20 05:01:11,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:01:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:01:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:01:11,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 05:01:11,752 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:01:11,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:01:11 BoogieIcfgContainer [2019-11-20 05:01:11,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:01:11,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:01:11,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:01:11,932 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:01:11,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:00:18" (3/4) ... [2019-11-20 05:01:11,936 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 05:01:11,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:01:11,938 INFO L168 Benchmark]: Toolchain (without parser) took 55830.79 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -547.3 MB). Peak memory consumption was 516.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:01:11,938 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:01:11,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:01:11,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:01:11,939 INFO L168 Benchmark]: Boogie Preprocessor took 91.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:01:11,940 INFO L168 Benchmark]: RCFGBuilder took 1309.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:01:11,943 INFO L168 Benchmark]: TraceAbstraction took 53665.42 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 902.3 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -467.6 MB). Peak memory consumption was 434.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:01:11,943 INFO L168 Benchmark]: Witness Printer took 5.14 ms. Allocated memory is still 2.1 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:01:11,949 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 666.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1309.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53665.42 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 902.3 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -467.6 MB). Peak memory consumption was 434.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.14 ms. Allocated memory is still 2.1 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: 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] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={8:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [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] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] 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] EXPR s->info_callback VAL [init=1, SSLv3_server_data={8:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={8:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={8:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={8:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [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={8:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={8:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={8:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={8:0}] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={8:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={8:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={8:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={8:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 53.6s, OverallIterations: 66, TraceHistogramMax: 7, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 14023 SDtfs, 5435 SDslu, 21551 SDs, 0 SdLazy, 14375 SolverSat, 883 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 531 GetRequests, 250 SyntacticMatches, 78 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4455occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 65 MinimizatonAttempts, 16231 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 7490 NumberOfCodeBlocks, 7490 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 7231 ConstructedInterpolants, 80 QuantifiedInterpolants, 3765794 SizeOfPredicates, 12 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 66 InterpolantComputations, 64 PerfectInterpolantSequences, 7526/7768 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.24-678e011 [2019-11-20 05:01:13,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:01:13,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:01:13,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:01:13,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:01:13,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:01:13,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:01:13,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:01:13,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:01:13,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:01:13,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:01:13,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:01:13,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:01:13,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:01:13,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:01:13,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:01:13,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:01:13,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:01:13,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:01:13,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:01:13,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:01:13,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:01:13,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:01:13,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:01:13,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:01:13,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:01:13,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:01:13,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:01:13,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:01:13,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:01:13,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:01:13,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:01:13,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:01:13,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:01:13,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:01:13,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:01:13,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:01:13,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:01:13,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:01:13,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:01:13,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:01:13,953 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 05:01:13,974 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:01:13,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:01:13,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:01:13,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:01:13,976 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:01:13,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:01:13,977 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:01:13,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:01:13,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:01:13,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:01:13,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:01:13,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:01:13,979 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 05:01:13,980 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 05:01:13,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:01:13,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:01:13,981 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:01:13,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:01:13,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:01:13,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:01:13,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:01:13,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:01:13,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:01:13,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:01:13,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:01:13,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:01:13,983 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 05:01:13,984 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 05:01:13,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:01:13,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 05:01:13,985 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer 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 -> Automizer 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 -> 2022a41801b102600c4bc475b4f1b54abdd4798f [2019-11-20 05:01:14,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:01:14,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:01:14,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:01:14,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:01:14,301 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:01:14,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-11-20 05:01:14,355 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data/c244b5ccf/79f23586a9724e0f91fcb38cf42d4de8/FLAGb85a5e0cc [2019-11-20 05:01:14,899 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:01:14,900 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-11-20 05:01:14,942 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data/c244b5ccf/79f23586a9724e0f91fcb38cf42d4de8/FLAGb85a5e0cc [2019-11-20 05:01:15,150 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/data/c244b5ccf/79f23586a9724e0f91fcb38cf42d4de8 [2019-11-20 05:01:15,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:01:15,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:01:15,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:01:15,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:01:15,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:01:15,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:15,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52af6e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15, skipping insertion in model container [2019-11-20 05:01:15,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:15,172 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:01:15,222 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:01:15,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:01:15,741 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:01:15,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:01:15,963 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:01:15,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15 WrapperNode [2019-11-20 05:01:15,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:01:15,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:01:15,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:01:15,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:01:15,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:01:16,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:01:16,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:01:16,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:01:16,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... [2019-11-20 05:01:16,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:01:16,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:01:16,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:01:16,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:01:16,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/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 [2019-11-20 05:01:16,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 05:01:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:01:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 05:01:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 05:01:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 05:01:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:01:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:01:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 05:01:16,579 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 05:01:19,819 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 05:01:19,820 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 05:01:19,821 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:01:19,821 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:01:19,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:01:19 BoogieIcfgContainer [2019-11-20 05:01:19,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:01:19,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:01:19,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:01:19,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:01:19,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:01:15" (1/3) ... [2019-11-20 05:01:19,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd7bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:01:19, skipping insertion in model container [2019-11-20 05:01:19,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:01:15" (2/3) ... [2019-11-20 05:01:19,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd7bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:01:19, skipping insertion in model container [2019-11-20 05:01:19,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:01:19" (3/3) ... [2019-11-20 05:01:19,832 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2019-11-20 05:01:19,841 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:01:19,848 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:01:19,860 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:01:19,883 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:01:19,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:01:19,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:01:19,885 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:01:19,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:01:19,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:01:19,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:01:19,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:01:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-20 05:01:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:01:19,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:19,916 INFO L410 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] [2019-11-20 05:01:19,916 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-20 05:01:19,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:01:19,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1726070832] [2019-11-20 05:01:19,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:20,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:01:20,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:01:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:01:20,251 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:01:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:01:20,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726070832] [2019-11-20 05:01:20,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:20,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 05:01:20,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017885143] [2019-11-20 05:01:20,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:20,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:01:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:20,307 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-20 05:01:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:20,576 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-20 05:01:20,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:20,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 05:01:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:20,602 INFO L225 Difference]: With dead ends: 564 [2019-11-20 05:01:20,605 INFO L226 Difference]: Without dead ends: 385 [2019-11-20 05:01:20,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-20 05:01:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-20 05:01:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-20 05:01:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-20 05:01:20,687 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-20 05:01:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:20,687 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-20 05:01:20,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-20 05:01:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 05:01:20,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:20,692 INFO L410 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] [2019-11-20 05:01:20,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:20,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:20,904 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2019-11-20 05:01:20,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:01:20,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [946590544] [2019-11-20 05:01:20,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:21,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:01:21,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:01:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:01:21,195 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:01:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:01:21,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946590544] [2019-11-20 05:01:21,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:21,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 05:01:21,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408002628] [2019-11-20 05:01:21,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:21,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:01:21,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:21,223 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-20 05:01:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:21,922 INFO L93 Difference]: Finished difference Result 877 states and 1350 transitions. [2019-11-20 05:01:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:21,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 05:01:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:21,927 INFO L225 Difference]: With dead ends: 877 [2019-11-20 05:01:21,927 INFO L226 Difference]: Without dead ends: 626 [2019-11-20 05:01:21,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-11-20 05:01:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-11-20 05:01:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-11-20 05:01:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 947 transitions. [2019-11-20 05:01:21,983 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 947 transitions. Word has length 58 [2019-11-20 05:01:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:21,985 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 947 transitions. [2019-11-20 05:01:21,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 947 transitions. [2019-11-20 05:01:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 05:01:21,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:21,999 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:01:22,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:22,202 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:22,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:22,202 INFO L82 PathProgramCache]: Analyzing trace with hash -222873622, now seen corresponding path program 1 times [2019-11-20 05:01:22,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:01:22,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [27408456] [2019-11-20 05:01:22,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:22,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:01:22,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:01:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:01:22,559 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:01:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 05:01:22,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [27408456] [2019-11-20 05:01:22,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:22,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 05:01:22,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058237392] [2019-11-20 05:01:22,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:01:22,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:01:22,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:01:22,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:01:22,618 INFO L87 Difference]: Start difference. First operand 624 states and 947 transitions. Second operand 3 states. [2019-11-20 05:01:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:23,659 INFO L93 Difference]: Finished difference Result 1236 states and 1885 transitions. [2019-11-20 05:01:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:01:23,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-20 05:01:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:23,664 INFO L225 Difference]: With dead ends: 1236 [2019-11-20 05:01:23,664 INFO L226 Difference]: Without dead ends: 744 [2019-11-20 05:01:23,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:01:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-11-20 05:01:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-11-20 05:01:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-11-20 05:01:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1127 transitions. [2019-11-20 05:01:23,703 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1127 transitions. Word has length 117 [2019-11-20 05:01:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:23,704 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1127 transitions. [2019-11-20 05:01:23,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:01:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1127 transitions. [2019-11-20 05:01:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 05:01:23,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:23,707 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2019-11-20 05:01:23,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:23,912 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash 369635549, now seen corresponding path program 1 times [2019-11-20 05:01:23,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:01:23,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1261419954] [2019-11-20 05:01:23,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:24,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:01:24,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:01:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:01:24,250 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:01:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:01:24,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1261419954] [2019-11-20 05:01:24,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:01:24,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 05:01:24,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209152945] [2019-11-20 05:01:24,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:01:24,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:01:24,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:01:24,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:24,297 INFO L87 Difference]: Start difference. First operand 744 states and 1127 transitions. Second operand 4 states. [2019-11-20 05:01:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:01:25,913 INFO L93 Difference]: Finished difference Result 1603 states and 2440 transitions. [2019-11-20 05:01:25,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:01:25,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-20 05:01:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:01:25,920 INFO L225 Difference]: With dead ends: 1603 [2019-11-20 05:01:25,921 INFO L226 Difference]: Without dead ends: 991 [2019-11-20 05:01:25,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:01:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-20 05:01:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-20 05:01:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-20 05:01:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1499 transitions. [2019-11-20 05:01:25,972 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1499 transitions. Word has length 141 [2019-11-20 05:01:25,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:01:25,972 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1499 transitions. [2019-11-20 05:01:25,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:01:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1499 transitions. [2019-11-20 05:01:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 05:01:25,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:01:25,976 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:01:26,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:26,180 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:01:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:01:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-11-20 05:01:26,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:01:26,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1160051290] [2019-11-20 05:01:26,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:01:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:01:27,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 05:01:27,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:01:27,498 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:27,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 05:01:27,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:27,909 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 05:01:27,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:27,912 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|], 2=[|v_#memory_$Pointer$.base_172|, |v_#memory_$Pointer$.base_171|]} [2019-11-20 05:01:27,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:27,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:27,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:27,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:27,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:27,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 05:01:28,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,301 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 05:01:28,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 05:01:28,356 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 05:01:28,428 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,458 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 05:01:28,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:01:28,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 05:01:28,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:01:28,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 05:01:28,599 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_173|], 12=[|v_#memory_$Pointer$.base_178|]} [2019-11-20 05:01:28,606 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:01:28,710 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 05:01:28,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 05:01:28,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 05:01:28,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:01:28,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 05:01:28,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:01:28,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:01:28,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 05:01:28,875 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_171|], 20=[|v_#memory_$Pointer$.base_181|]} [2019-11-20 05:01:28,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 05:01:28,882 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:01:28,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:28,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:28,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:29,386 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 05:01:29,386 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 05:01:29,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 05:01:29,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:01:29,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:01:29,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:01:29,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:01:29,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:01:29,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:01:29,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:01:29,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:01:29,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:01:29,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:01:29,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:01:29,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:01:29,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:01:29,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:01:41,985 WARN L191 SmtUtils]: Spent 12.58 s on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-11-20 05:01:41,985 INFO L567 ElimStorePlain]: treesize reduction 3950, result has 2.1 percent of original size [2019-11-20 05:01:41,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:01:41,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-20 05:01:42,042 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 30=[|v_#memory_$Pointer$.base_182|]} [2019-11-20 05:01:42,050 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:01:42,154 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 05:01:42,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:01:42,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:01:42,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:15,258 WARN L191 SmtUtils]: Spent 33.07 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 05:02:15,259 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 05:02:15,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-20 05:02:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:15,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:15,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:15,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:02:15,649 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 40 [2019-11-20 05:02:15,649 INFO L567 ElimStorePlain]: treesize reduction 11799, result has 0.8 percent of original size [2019-11-20 05:02:15,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:15,650 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 05:02:15,705 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_191|], 30=[|v_#memory_$Pointer$.base_183|]} [2019-11-20 05:02:15,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-11-20 05:02:15,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:02:15,835 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 05:02:15,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:15,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:15,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:15,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:15,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:15,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:15,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:32,288 WARN L191 SmtUtils]: Spent 16.44 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 05:02:32,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:32,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-20 05:02:32,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:32,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:32,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:02:32,505 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 42 [2019-11-20 05:02:32,506 INFO L567 ElimStorePlain]: treesize reduction 5264, result has 1.7 percent of original size [2019-11-20 05:02:32,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:32,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 05:02:32,569 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_172|], 2=[|v_#memory_int_192|], 20=[|v_#memory_$Pointer$.base_184|]} [2019-11-20 05:02:32,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 25 [2019-11-20 05:02:32,583 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:32,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:32,653 INFO L377 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 35 treesize of output 28 [2019-11-20 05:02:32,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:02:32,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:32,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:32,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:32,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:32,853 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 05:02:32,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:32,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-20 05:02:32,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:32,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:33,062 INFO L496 ElimStorePlain]: Start of recursive call 4: 118 dim-0 vars, End of recursive call: 118 dim-0 vars, and 16 xjuncts. [2019-11-20 05:02:50,058 WARN L191 SmtUtils]: Spent 16.99 s on a formula simplification that was a NOOP. DAG size: 973 [2019-11-20 05:02:50,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:50,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 05:02:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-20 05:02:50,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 05:02:50,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 05:02:50,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 05:02:50,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:02:50,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 05:02:50,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 05:02:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:02:50,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:02:50,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 236 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:50,173 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:1666 [2019-11-20 05:02:51,738 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 1195 DAG size of output: 24 [2019-11-20 05:02:51,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:02:51,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-20 05:02:51,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:02:51,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:51,786 INFO L496 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. [2019-11-20 05:02:51,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-20 05:02:51,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-20 05:02:51,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:02:51,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:51,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:02:51,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 05:02:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:02:52,244 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:02:52,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-20 05:02:52,335 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:52,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 05:02:52,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:02:52,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:52,484 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:52,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2019-11-20 05:02:52,554 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_188|], 2=[|v_#memory_$Pointer$.base_174|]} [2019-11-20 05:02:52,557 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:52,574 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:52,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-11-20 05:02:52,623 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 05:02:52,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2019-11-20 05:02:52,624 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:52,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-11-20 05:02:52,763 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:52,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:52,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 05:02:53,089 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:53,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:53,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:53,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 05:02:53,862 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_173|], 20=[|v_#memory_$Pointer$.base_192|]} [2019-11-20 05:02:53,869 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:53,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:53,948 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:53,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:53,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:53,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2019-11-20 05:02:54,541 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:54,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:54,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:54,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 05:02:54,717 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:54,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:02:54,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 05:02:54,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 05:02:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:02:55,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1160051290] [2019-11-20 05:02:55,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:02:55,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 05:02:55,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878993724] [2019-11-20 05:02:55,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 05:02:55,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:02:55,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 05:02:55,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:02:55,138 INFO L87 Difference]: Start difference. First operand 991 states and 1499 transitions. Second operand 13 states. [2019-11-20 05:03:46,795 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-20 05:03:53,761 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-20 05:04:38,154 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 05:04:44,197 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-20 05:06:31,151 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-20 05:06:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:06:48,884 INFO L93 Difference]: Finished difference Result 6739 states and 10251 transitions. [2019-11-20 05:06:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 05:06:48,886 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-11-20 05:06:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:06:48,924 INFO L225 Difference]: With dead ends: 6739 [2019-11-20 05:06:48,924 INFO L226 Difference]: Without dead ends: 5756 [2019-11-20 05:06:48,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 309 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-11-20 05:06:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2019-11-20 05:06:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 2516. [2019-11-20 05:06:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2019-11-20 05:06:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4034 transitions. [2019-11-20 05:06:49,099 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4034 transitions. Word has length 164 [2019-11-20 05:06:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:06:49,100 INFO L462 AbstractCegarLoop]: Abstraction has 2516 states and 4034 transitions. [2019-11-20 05:06:49,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 05:06:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4034 transitions. [2019-11-20 05:06:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 05:06:49,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:06:49,106 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-20 05:06:49,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:06:49,314 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:06:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:06:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash 632129532, now seen corresponding path program 1 times [2019-11-20 05:06:49,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:06:49,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [908252701] [2019-11-20 05:06:49,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:06:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:06:50,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 05:06:50,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:06:50,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:50,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 05:06:50,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,150 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 05:06:51,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,152 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_200|], 2=[|v_#memory_$Pointer$.base_196|, |v_#memory_$Pointer$.base_197|]} [2019-11-20 05:06:51,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 05:06:51,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,406 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 05:06:51,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,411 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:06:51,537 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 05:06:51,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 05:06:51,558 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,619 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 05:06:51,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,675 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:06:51,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 05:06:51,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:06:51,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 05:06:51,761 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_198|], 12=[|v_#memory_$Pointer$.base_203|]} [2019-11-20 05:06:51,769 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:06:51,915 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 05:06:51,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:51,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 05:06:51,940 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:51,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:06:51,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 05:06:52,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:52,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:06:52,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:06:52,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:52,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:06:52,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 05:06:52,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:52,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 05:06:52,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:06:52,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:52,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:06:52,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 05:06:52,119 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_184|], 20=[|v_#memory_$Pointer$.base_206|]} [2019-11-20 05:06:52,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 05:06:52,130 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:06:52,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:06:52,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:06:52,762 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 05:06:52,762 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 05:06:52,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 05:06:52,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:52,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:52,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:06:53,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:06:53,663 INFO L496 ElimStorePlain]: Start of recursive call 3: 85 dim-0 vars, End of recursive call: 85 dim-0 vars, and 3 xjuncts. [2019-11-20 05:07:51,542 WARN L191 SmtUtils]: Spent 57.88 s on a formula simplification. DAG size of input: 1476 DAG size of output: 852 [2019-11-20 05:07:51,543 INFO L567 ElimStorePlain]: treesize reduction 8213, result has 42.6 percent of original size [2019-11-20 05:07:51,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:07:51,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 05:07:51,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:07:51,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:07:51,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:07:51,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 120 dim-0 vars, and 1 xjuncts. [2019-11-20 05:07:51,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:6823 [2019-11-20 05:07:51,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:51,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:54,087 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 1027 DAG size of output: 44 [2019-11-20 05:07:54,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:54,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:54,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:07:54,136 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_199|], 30=[|v_#memory_$Pointer$.base_207|]} [2019-11-20 05:07:54,141 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:07:54,259 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 05:07:54,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:07:54,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:07:54,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:08:27,331 WARN L191 SmtUtils]: Spent 33.04 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 05:08:27,331 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 05:08:27,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-20 05:08:27,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:08:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:08:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:08:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:08:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:08:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:08:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:08:27,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:09:02,912 WARN L191 SmtUtils]: Spent 35.57 s on a formula simplification. DAG size of input: 127 DAG size of output: 40 [2019-11-20 05:09:02,912 INFO L567 ElimStorePlain]: treesize reduction 11479, result has 0.8 percent of original size [2019-11-20 05:09:02,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:09:02,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 05:09:02,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:02,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:02,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:03,916 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_205|], 30=[|v_#memory_$Pointer$.base_208|]} [2019-11-20 05:09:03,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-11-20 05:09:03,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:09:04,072 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 05:09:04,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:04,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:04,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:04,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:04,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:04,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:04,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:20,668 WARN L191 SmtUtils]: Spent 16.57 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 05:09:20,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:20,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-20 05:09:20,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:20,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:20,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:20,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:20,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:20,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:20,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:20,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:09:21,111 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 42 [2019-11-20 05:09:21,112 INFO L567 ElimStorePlain]: treesize reduction 5341, result has 1.7 percent of original size [2019-11-20 05:09:21,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 05:09:21,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 05:09:21,173 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_185|], 2=[|v_#memory_int_206|], 20=[|v_#memory_$Pointer$.base_209|]} [2019-11-20 05:09:21,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 25 [2019-11-20 05:09:21,189 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:09:21,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:21,256 INFO L377 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 35 treesize of output 28 [2019-11-20 05:09:21,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:09:21,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:21,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:21,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:21,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:21,476 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 05:09:21,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:21,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-20 05:09:21,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:21,556 INFO L496 ElimStorePlain]: Start of recursive call 4: 150 dim-0 vars, End of recursive call: 150 dim-0 vars, and 19 xjuncts. [2019-11-20 05:09:52,645 WARN L191 SmtUtils]: Spent 31.09 s on a formula simplification that was a NOOP. DAG size: 1197 [2019-11-20 05:09:52,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:52,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-11-20 05:09:52,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:09:52,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 05:09:52,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:09:52,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 05:09:52,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 05:09:52,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:09:52,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:09:52,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:52,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:09:52,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 05:09:52,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 05:09:52,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:09:52,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 05:09:52,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:09:52,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:09:52,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 05:09:52,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:09:52,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:09:52,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 300 dim-0 vars, and 1 xjuncts. [2019-11-20 05:09:52,722 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:2114 [2019-11-20 05:09:55,123 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 1515 DAG size of output: 24 [2019-11-20 05:09:55,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:09:55,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-20 05:09:55,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:09:55,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:55,162 INFO L496 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. [2019-11-20 05:09:55,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-20 05:09:55,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-20 05:09:55,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:09:55,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:55,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:09:55,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 05:09:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 64 proven. 98 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 05:09:55,580 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:09:55,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-20 05:09:55,645 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:09:55,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:09:55,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:09:55,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 05:09:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-20 05:09:55,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [908252701] [2019-11-20 05:09:55,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:09:55,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-20 05:09:55,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459677516] [2019-11-20 05:09:55,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:09:55,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:09:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:09:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:09:55,748 INFO L87 Difference]: Start difference. First operand 2516 states and 4034 transitions. Second operand 4 states. [2019-11-20 05:09:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:09:59,760 INFO L93 Difference]: Finished difference Result 6762 states and 10754 transitions. [2019-11-20 05:09:59,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:09:59,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-20 05:09:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:09:59,787 INFO L225 Difference]: With dead ends: 6762 [2019-11-20 05:09:59,787 INFO L226 Difference]: Without dead ends: 4254 [2019-11-20 05:09:59,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 274 SyntacticMatches, 46 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:09:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2019-11-20 05:09:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 3156. [2019-11-20 05:09:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3156 states. [2019-11-20 05:09:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 3156 states and 5218 transitions. [2019-11-20 05:09:59,967 INFO L78 Accepts]: Start accepts. Automaton has 3156 states and 5218 transitions. Word has length 165 [2019-11-20 05:09:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:09:59,968 INFO L462 AbstractCegarLoop]: Abstraction has 3156 states and 5218 transitions. [2019-11-20 05:09:59,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:09:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3156 states and 5218 transitions. [2019-11-20 05:09:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 05:09:59,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:09:59,978 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:10:00,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:00,189 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:10:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:10:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash -329499811, now seen corresponding path program 1 times [2019-11-20 05:10:00,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:10:00,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [104606614] [2019-11-20 05:10:00,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:10:01,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:10:01,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:10:01,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:10:01,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-20 05:10:01,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:01,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:01,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:01,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 05:10:01,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:01,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 05:10:01,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:01,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:01,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:01,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 05:10:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 05:10:01,830 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:10:01,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 18 [2019-11-20 05:10:01,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:01,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:01,854 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:01,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:01,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:01,855 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 05:10:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 05:10:01,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [104606614] [2019-11-20 05:10:01,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:10:01,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 05:10:01,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901053965] [2019-11-20 05:10:01,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 05:10:01,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:10:01,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 05:10:01,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:10:01,896 INFO L87 Difference]: Start difference. First operand 3156 states and 5218 transitions. Second operand 7 states. [2019-11-20 05:10:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:10:09,469 INFO L93 Difference]: Finished difference Result 9526 states and 15364 transitions. [2019-11-20 05:10:09,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:10:09,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-11-20 05:10:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:10:09,507 INFO L225 Difference]: With dead ends: 9526 [2019-11-20 05:10:09,507 INFO L226 Difference]: Without dead ends: 6378 [2019-11-20 05:10:09,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:10:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6378 states. [2019-11-20 05:10:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6378 to 3840. [2019-11-20 05:10:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2019-11-20 05:10:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 6430 transitions. [2019-11-20 05:10:09,702 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 6430 transitions. Word has length 170 [2019-11-20 05:10:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:10:09,702 INFO L462 AbstractCegarLoop]: Abstraction has 3840 states and 6430 transitions. [2019-11-20 05:10:09,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 05:10:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 6430 transitions. [2019-11-20 05:10:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 05:10:09,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:10:09,712 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:10:09,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:09,930 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:10:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:10:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash 449764481, now seen corresponding path program 1 times [2019-11-20 05:10:09,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:10:09,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2107110077] [2019-11-20 05:10:09,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:10:11,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:10:11,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:10:11,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:10:11,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-20 05:10:11,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:11,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:11,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:11,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 05:10:11,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:11,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 05:10:11,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:11,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:11,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:11,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 05:10:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 05:10:11,599 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:10:11,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 18 [2019-11-20 05:10:11,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:11,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:11,631 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:11,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:11,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:11,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 05:10:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 05:10:11,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2107110077] [2019-11-20 05:10:11,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:10:11,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 05:10:11,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475269527] [2019-11-20 05:10:11,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 05:10:11,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:10:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 05:10:11,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:10:11,663 INFO L87 Difference]: Start difference. First operand 3840 states and 6430 transitions. Second operand 7 states. [2019-11-20 05:10:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:10:19,360 INFO L93 Difference]: Finished difference Result 10210 states and 16560 transitions. [2019-11-20 05:10:19,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:10:19,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-11-20 05:10:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:10:19,394 INFO L225 Difference]: With dead ends: 10210 [2019-11-20 05:10:19,394 INFO L226 Difference]: Without dead ends: 6378 [2019-11-20 05:10:19,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:10:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6378 states. [2019-11-20 05:10:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6378 to 3872. [2019-11-20 05:10:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3872 states. [2019-11-20 05:10:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 6478 transitions. [2019-11-20 05:10:19,574 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 6478 transitions. Word has length 171 [2019-11-20 05:10:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:10:19,575 INFO L462 AbstractCegarLoop]: Abstraction has 3872 states and 6478 transitions. [2019-11-20 05:10:19,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 05:10:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 6478 transitions. [2019-11-20 05:10:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 05:10:19,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:10:19,583 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:10:19,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:19,791 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:10:19,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:10:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1627207883, now seen corresponding path program 1 times [2019-11-20 05:10:19,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:10:19,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [602702958] [2019-11-20 05:10:19,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:10:20,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:10:20,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:10:20,184 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_197|, |v_#memory_$Pointer$.base_221|], 4=[|v_#memory_int_221|]} [2019-11-20 05:10:20,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2019-11-20 05:10:20,187 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:10:20,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:20,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2019-11-20 05:10:20,197 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:10:20,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:20,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:20,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-20 05:10:20,237 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:28,377 WARN L191 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 05:10:28,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:28,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:28,378 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 05:10:28,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-11-20 05:10:28,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:28,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:28,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:28,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 05:10:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 05:10:28,420 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:10:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 05:10:28,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [602702958] [2019-11-20 05:10:28,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:10:28,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:10:28,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069309176] [2019-11-20 05:10:28,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:10:28,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:10:28,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:10:28,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:10:28,464 INFO L87 Difference]: Start difference. First operand 3872 states and 6478 transitions. Second operand 6 states. [2019-11-20 05:10:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:10:39,788 INFO L93 Difference]: Finished difference Result 9454 states and 15394 transitions. [2019-11-20 05:10:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:10:39,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-11-20 05:10:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:10:39,805 INFO L225 Difference]: With dead ends: 9454 [2019-11-20 05:10:39,805 INFO L226 Difference]: Without dead ends: 6072 [2019-11-20 05:10:39,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:10:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2019-11-20 05:10:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 4035. [2019-11-20 05:10:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4035 states. [2019-11-20 05:10:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 6714 transitions. [2019-11-20 05:10:40,007 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 6714 transitions. Word has length 178 [2019-11-20 05:10:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:10:40,007 INFO L462 AbstractCegarLoop]: Abstraction has 4035 states and 6714 transitions. [2019-11-20 05:10:40,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:10:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 6714 transitions. [2019-11-20 05:10:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 05:10:40,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:10:40,017 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:10:40,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:40,222 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:10:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:10:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1874706975, now seen corresponding path program 2 times [2019-11-20 05:10:40,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:10:40,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1690951384] [2019-11-20 05:10:40,223 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:40,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:10:40,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:10:40,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:10:41,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:10:41,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:10:41,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-20 05:10:41,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:41,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:41,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:41,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 05:10:41,037 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:41,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 05:10:41,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:41,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:41,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:41,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 05:10:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 05:10:41,068 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:10:41,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 20 [2019-11-20 05:10:41,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:41,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:41,096 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:41,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:41,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:41,098 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 05:10:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 05:10:41,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1690951384] [2019-11-20 05:10:41,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:10:41,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 05:10:41,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082279194] [2019-11-20 05:10:41,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:10:41,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:10:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:10:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:10:41,117 INFO L87 Difference]: Start difference. First operand 4035 states and 6714 transitions. Second operand 4 states. [2019-11-20 05:10:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:10:44,602 INFO L93 Difference]: Finished difference Result 7226 states and 11673 transitions. [2019-11-20 05:10:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:10:44,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 05:10:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:10:44,613 INFO L225 Difference]: With dead ends: 7226 [2019-11-20 05:10:44,613 INFO L226 Difference]: Without dead ends: 5093 [2019-11-20 05:10:44,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:10:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2019-11-20 05:10:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 4035. [2019-11-20 05:10:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4035 states. [2019-11-20 05:10:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 6657 transitions. [2019-11-20 05:10:44,771 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 6657 transitions. Word has length 178 [2019-11-20 05:10:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:10:44,771 INFO L462 AbstractCegarLoop]: Abstraction has 4035 states and 6657 transitions. [2019-11-20 05:10:44,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:10:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 6657 transitions. [2019-11-20 05:10:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 05:10:44,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:10:44,785 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:10:44,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:44,991 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:10:44,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:10:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2136457801, now seen corresponding path program 1 times [2019-11-20 05:10:44,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:10:44,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1344362000] [2019-11-20 05:10:44,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:10:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:10:45,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:10:45,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:10:45,464 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_245|, |v_#memory_$Pointer$.offset_221|], 4=[|v_#memory_int_246|]} [2019-11-20 05:10:45,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 73 [2019-11-20 05:10:45,466 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:10:45,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:45,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2019-11-20 05:10:45,481 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:10:45,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:45,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:45,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-20 05:10:45,524 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:53,639 WARN L191 SmtUtils]: Spent 8.12 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 05:10:53,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:53,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:53,640 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 05:10:53,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-11-20 05:10:53,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:10:53,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:10:53,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:10:53,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 05:10:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 05:10:53,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:10:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 05:10:53,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1344362000] [2019-11-20 05:10:53,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:10:53,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:10:53,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251631065] [2019-11-20 05:10:53,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:10:53,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:10:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:10:53,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:10:53,749 INFO L87 Difference]: Start difference. First operand 4035 states and 6657 transitions. Second operand 6 states. [2019-11-20 05:11:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:11:02,124 INFO L93 Difference]: Finished difference Result 10285 states and 16570 transitions. [2019-11-20 05:11:02,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:11:02,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-11-20 05:11:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:11:02,136 INFO L225 Difference]: With dead ends: 10285 [2019-11-20 05:11:02,136 INFO L226 Difference]: Without dead ends: 6269 [2019-11-20 05:11:02,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:11:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6269 states. [2019-11-20 05:11:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6269 to 4471. [2019-11-20 05:11:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-20 05:11:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 7403 transitions. [2019-11-20 05:11:02,314 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 7403 transitions. Word has length 178 [2019-11-20 05:11:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:11:02,314 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 7403 transitions. [2019-11-20 05:11:02,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:11:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 7403 transitions. [2019-11-20 05:11:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 05:11:02,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:11:02,322 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:11:02,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:02,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:11:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:11:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1614304885, now seen corresponding path program 2 times [2019-11-20 05:11:02,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:11:02,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [88708158] [2019-11-20 05:11:02,527 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:03,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:11:03,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:11:03,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:11:03,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:11:03,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:11:03,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-20 05:11:03,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:03,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:03,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:03,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 05:11:03,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:03,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 05:11:03,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:03,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:03,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:03,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 05:11:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 05:11:03,367 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:11:03,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 20 [2019-11-20 05:11:03,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:03,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:03,400 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:03,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:03,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:03,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 05:11:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 05:11:03,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [88708158] [2019-11-20 05:11:03,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:11:03,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 05:11:03,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928749126] [2019-11-20 05:11:03,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:11:03,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:11:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:11:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:11:03,426 INFO L87 Difference]: Start difference. First operand 4471 states and 7403 transitions. Second operand 4 states. [2019-11-20 05:11:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:11:06,160 INFO L93 Difference]: Finished difference Result 7874 states and 12691 transitions. [2019-11-20 05:11:06,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:11:06,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 05:11:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:11:06,174 INFO L225 Difference]: With dead ends: 7874 [2019-11-20 05:11:06,174 INFO L226 Difference]: Without dead ends: 5523 [2019-11-20 05:11:06,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:11:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2019-11-20 05:11:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 4471. [2019-11-20 05:11:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-20 05:11:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 7336 transitions. [2019-11-20 05:11:06,388 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 7336 transitions. Word has length 178 [2019-11-20 05:11:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:11:06,389 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 7336 transitions. [2019-11-20 05:11:06,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:11:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 7336 transitions. [2019-11-20 05:11:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 05:11:06,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:11:06,398 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:11:06,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:06,605 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:11:06,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:11:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1005989766, now seen corresponding path program 1 times [2019-11-20 05:11:06,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:11:06,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [392810880] [2019-11-20 05:11:06,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:11:07,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:11:07,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:11:07,200 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_262|, |v_#memory_$Pointer$.offset_238|], 4=[|v_#memory_int_264|]} [2019-11-20 05:11:07,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 73 [2019-11-20 05:11:07,202 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:11:07,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:07,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2019-11-20 05:11:07,215 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:11:07,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:07,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:07,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-20 05:11:07,265 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:15,395 WARN L191 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 05:11:15,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:15,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:15,396 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 05:11:15,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-11-20 05:11:15,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:15,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:15,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:15,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 05:11:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:11:15,434 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:11:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 05:11:15,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [392810880] [2019-11-20 05:11:15,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:11:15,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:11:15,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642476002] [2019-11-20 05:11:15,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:11:15,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:11:15,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:11:15,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:11:15,556 INFO L87 Difference]: Start difference. First operand 4471 states and 7336 transitions. Second operand 6 states. [2019-11-20 05:11:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:11:22,139 INFO L93 Difference]: Finished difference Result 11333 states and 18193 transitions. [2019-11-20 05:11:22,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:11:22,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-11-20 05:11:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:11:22,149 INFO L225 Difference]: With dead ends: 11333 [2019-11-20 05:11:22,150 INFO L226 Difference]: Without dead ends: 6881 [2019-11-20 05:11:22,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:11:22,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6881 states. [2019-11-20 05:11:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6881 to 4779. [2019-11-20 05:11:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4779 states. [2019-11-20 05:11:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 7782 transitions. [2019-11-20 05:11:22,463 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 7782 transitions. Word has length 179 [2019-11-20 05:11:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:11:22,464 INFO L462 AbstractCegarLoop]: Abstraction has 4779 states and 7782 transitions. [2019-11-20 05:11:22,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:11:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 7782 transitions. [2019-11-20 05:11:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 05:11:22,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:11:22,474 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:11:22,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:22,679 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:11:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:11:22,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1596226618, now seen corresponding path program 1 times [2019-11-20 05:11:22,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:11:22,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1076060793] [2019-11-20 05:11:22,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:11:23,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:11:23,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:11:23,323 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_247|, |v_#memory_$Pointer$.base_271|], 4=[|v_#memory_int_273|]} [2019-11-20 05:11:23,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2019-11-20 05:11:23,331 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:11:23,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:23,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2019-11-20 05:11:23,348 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:11:23,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:23,422 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:23,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-20 05:11:23,423 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:31,556 WARN L191 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 05:11:31,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:31,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:31,557 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 05:11:31,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-11-20 05:11:31,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:31,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:31,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:31,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 05:11:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 05:11:31,597 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:11:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 05:11:31,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1076060793] [2019-11-20 05:11:31,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:11:31,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:11:31,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213338567] [2019-11-20 05:11:31,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:11:31,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:11:31,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:11:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:11:31,643 INFO L87 Difference]: Start difference. First operand 4779 states and 7782 transitions. Second operand 6 states. [2019-11-20 05:11:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:11:40,590 INFO L93 Difference]: Finished difference Result 10952 states and 17439 transitions. [2019-11-20 05:11:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:11:40,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-11-20 05:11:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:11:40,596 INFO L225 Difference]: With dead ends: 10952 [2019-11-20 05:11:40,596 INFO L226 Difference]: Without dead ends: 6779 [2019-11-20 05:11:40,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:11:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2019-11-20 05:11:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 4787. [2019-11-20 05:11:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4787 states. [2019-11-20 05:11:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4787 states and 7726 transitions. [2019-11-20 05:11:40,792 INFO L78 Accepts]: Start accepts. Automaton has 4787 states and 7726 transitions. Word has length 180 [2019-11-20 05:11:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:11:40,792 INFO L462 AbstractCegarLoop]: Abstraction has 4787 states and 7726 transitions. [2019-11-20 05:11:40,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:11:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4787 states and 7726 transitions. [2019-11-20 05:11:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 05:11:40,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:11:40,800 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:11:41,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:41,005 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:11:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:11:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1191303164, now seen corresponding path program 1 times [2019-11-20 05:11:41,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:11:41,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1354769592] [2019-11-20 05:11:41,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:11:41,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 05:11:41,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:11:41,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:11:41,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 05:11:41,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:41,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:41,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:41,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 05:11:41,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:11:41,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:41,640 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 05:11:41,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:41,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:41,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:41,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 05:11:41,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-11-20 05:11:41,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:41,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:41,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:41,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 05:11:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 05:11:41,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:11:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 05:11:41,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354769592] [2019-11-20 05:11:41,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:11:41,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:11:41,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711984304] [2019-11-20 05:11:41,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:11:41,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:11:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:11:41,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:11:41,744 INFO L87 Difference]: Start difference. First operand 4787 states and 7726 transitions. Second operand 6 states. [2019-11-20 05:11:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:11:47,657 INFO L93 Difference]: Finished difference Result 8428 states and 13286 transitions. [2019-11-20 05:11:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:11:47,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-11-20 05:11:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:11:47,664 INFO L225 Difference]: With dead ends: 8428 [2019-11-20 05:11:47,664 INFO L226 Difference]: Without dead ends: 5915 [2019-11-20 05:11:47,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:11:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2019-11-20 05:11:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 4787. [2019-11-20 05:11:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4787 states. [2019-11-20 05:11:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4787 states and 7645 transitions. [2019-11-20 05:11:47,834 INFO L78 Accepts]: Start accepts. Automaton has 4787 states and 7645 transitions. Word has length 180 [2019-11-20 05:11:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:11:47,834 INFO L462 AbstractCegarLoop]: Abstraction has 4787 states and 7645 transitions. [2019-11-20 05:11:47,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:11:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4787 states and 7645 transitions. [2019-11-20 05:11:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 05:11:47,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:11:47,843 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:11:48,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:48,049 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:11:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:11:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash -78301818, now seen corresponding path program 1 times [2019-11-20 05:11:48,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:11:48,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1113051531] [2019-11-20 05:11:48,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:11:48,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 05:11:48,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:11:48,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:11:48,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 05:11:48,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:48,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:48,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:48,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 05:11:48,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:11:48,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:48,766 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 05:11:48,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:48,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:48,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:48,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 05:11:48,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-11-20 05:11:48,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:48,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:48,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:48,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 05:11:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 05:11:48,807 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:11:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 05:11:48,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1113051531] [2019-11-20 05:11:48,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:11:48,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:11:48,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044308060] [2019-11-20 05:11:48,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:11:48,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:11:48,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:11:48,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:11:48,904 INFO L87 Difference]: Start difference. First operand 4787 states and 7645 transitions. Second operand 6 states. [2019-11-20 05:11:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:11:54,926 INFO L93 Difference]: Finished difference Result 8428 states and 13161 transitions. [2019-11-20 05:11:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:11:54,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-11-20 05:11:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:11:54,932 INFO L225 Difference]: With dead ends: 8428 [2019-11-20 05:11:54,932 INFO L226 Difference]: Without dead ends: 5915 [2019-11-20 05:11:54,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:11:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2019-11-20 05:11:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 4787. [2019-11-20 05:11:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4787 states. [2019-11-20 05:11:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4787 states and 7564 transitions. [2019-11-20 05:11:55,186 INFO L78 Accepts]: Start accepts. Automaton has 4787 states and 7564 transitions. Word has length 181 [2019-11-20 05:11:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:11:55,186 INFO L462 AbstractCegarLoop]: Abstraction has 4787 states and 7564 transitions. [2019-11-20 05:11:55,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:11:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4787 states and 7564 transitions. [2019-11-20 05:11:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 05:11:55,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:11:55,193 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 05:11:55,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:55,395 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:11:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:11:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1857331383, now seen corresponding path program 1 times [2019-11-20 05:11:55,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:11:55,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [435020698] [2019-11-20 05:11:55,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:11:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:11:56,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 05:11:56,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:11:56,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:11:56,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 05:11:56,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:56,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:56,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:56,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 05:11:56,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:11:56,136 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:56,137 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 05:11:56,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:56,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:56,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:56,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 05:11:56,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-11-20 05:11:56,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:11:56,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:11:56,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:11:56,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 05:11:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 05:11:56,202 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:11:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 05:11:56,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [435020698] [2019-11-20 05:11:56,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:11:56,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 05:11:56,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466177739] [2019-11-20 05:11:56,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:11:56,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:11:56,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:11:56,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:11:56,265 INFO L87 Difference]: Start difference. First operand 4787 states and 7564 transitions. Second operand 6 states. [2019-11-20 05:12:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:12:01,143 INFO L93 Difference]: Finished difference Result 8338 states and 12919 transitions. [2019-11-20 05:12:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:12:01,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-11-20 05:12:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:12:01,149 INFO L225 Difference]: With dead ends: 8338 [2019-11-20 05:12:01,150 INFO L226 Difference]: Without dead ends: 5825 [2019-11-20 05:12:01,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:12:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5825 states. [2019-11-20 05:12:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5825 to 4787. [2019-11-20 05:12:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4787 states. [2019-11-20 05:12:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4787 states and 7483 transitions. [2019-11-20 05:12:01,378 INFO L78 Accepts]: Start accepts. Automaton has 4787 states and 7483 transitions. Word has length 182 [2019-11-20 05:12:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:12:01,378 INFO L462 AbstractCegarLoop]: Abstraction has 4787 states and 7483 transitions. [2019-11-20 05:12:01,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:12:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4787 states and 7483 transitions. [2019-11-20 05:12:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 05:12:01,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:12:01,386 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 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] [2019-11-20 05:12:01,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:12:01,589 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:12:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:12:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1967014405, now seen corresponding path program 1 times [2019-11-20 05:12:01,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:12:01,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [831595767] [2019-11-20 05:12:01,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:12:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:12:03,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 05:12:03,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:12:03,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:12:03,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-20 05:12:03,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:12:03,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:12:03,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:12:03,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 05:12:03,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:12:03,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 05:12:03,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:12:03,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:12:03,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:12:03,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 05:12:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-11-20 05:12:03,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:12:03,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 20 [2019-11-20 05:12:03,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:12:03,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:12:03,838 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:12:03,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:12:03,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:12:03,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 05:12:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-11-20 05:12:03,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [831595767] [2019-11-20 05:12:03,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:12:03,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 05:12:03,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565312324] [2019-11-20 05:12:03,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:12:03,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:12:03,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:12:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:12:03,870 INFO L87 Difference]: Start difference. First operand 4787 states and 7483 transitions. Second operand 4 states. [2019-11-20 05:12:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:12:06,945 INFO L93 Difference]: Finished difference Result 11215 states and 17337 transitions. [2019-11-20 05:12:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:12:06,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-20 05:12:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:12:06,953 INFO L225 Difference]: With dead ends: 11215 [2019-11-20 05:12:06,953 INFO L226 Difference]: Without dead ends: 6447 [2019-11-20 05:12:06,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:12:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6447 states. [2019-11-20 05:12:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6447 to 5235. [2019-11-20 05:12:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5235 states. [2019-11-20 05:12:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5235 states to 5235 states and 8113 transitions. [2019-11-20 05:12:07,145 INFO L78 Accepts]: Start accepts. Automaton has 5235 states and 8113 transitions. Word has length 193 [2019-11-20 05:12:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:12:07,145 INFO L462 AbstractCegarLoop]: Abstraction has 5235 states and 8113 transitions. [2019-11-20 05:12:07,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:12:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5235 states and 8113 transitions. [2019-11-20 05:12:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 05:12:07,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:12:07,152 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:12:07,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:12:07,353 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:12:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:12:07,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2019-11-20 05:12:07,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:12:07,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [96368454] [2019-11-20 05:12:07,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:12:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:12:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:12:11,195 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 05:12:11,196 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:12:11,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 05:12:11,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:12:11 BoogieIcfgContainer [2019-11-20 05:12:11,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:12:11,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:12:11,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:12:11,609 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:12:11,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:01:19" (3/4) ... [2019-11-20 05:12:11,612 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:12:11,756 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_669bad45-7209-4ade-8428-401419028bae/bin/uautomizer/witness.graphml [2019-11-20 05:12:11,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:12:11,758 INFO L168 Benchmark]: Toolchain (without parser) took 656604.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 951.0 MB in the beginning and 752.8 MB in the end (delta: 198.2 MB). Peak memory consumption was 517.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:11,758 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:12:11,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:11,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:11,760 INFO L168 Benchmark]: Boogie Preprocessor took 129.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:11,760 INFO L168 Benchmark]: RCFGBuilder took 3610.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.2 MB). Peak memory consumption was 93.2 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:11,760 INFO L168 Benchmark]: TraceAbstraction took 651783.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.5 MB). Free memory was 1.0 GB in the beginning and 780.9 MB in the end (delta: 236.6 MB). Peak memory consumption was 398.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:11,761 INFO L168 Benchmark]: Witness Printer took 148.36 ms. Allocated memory is still 1.3 GB. Free memory was 780.9 MB in the beginning and 752.8 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:11,763 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 806.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3610.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.2 MB). Peak memory consumption was 93.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 651783.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.5 MB). Free memory was 1.0 GB in the beginning and 780.9 MB in the end (delta: 236.6 MB). Peak memory consumption was 398.0 MB. Max. memory is 11.5 GB. * Witness Printer took 148.36 ms. Allocated memory is still 1.3 GB. Free memory was 780.9 MB in the beginning and 752.8 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={1723926188:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [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] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] 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] EXPR s->info_callback VAL [init=1, SSLv3_server_data={1723926188:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={1723926188:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={1723926188:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [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={1723926188:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={1723926188:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={1723926188:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={1723926188:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={1723926188:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 651.7s, OverallIterations: 19, TraceHistogramMax: 7, AutomataDifference: 318.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3718 SDtfs, 5320 SDslu, 8384 SDs, 0 SdLazy, 7962 SolverSat, 1270 SolverUnsat, 94 SolverUnknown, 0 SolverNotchecked, 304.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5655 GetRequests, 5488 SyntacticMatches, 56 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5235occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 23931 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 12.5s SatisfiabilityAnalysisTime, 308.5s InterpolantComputationTime, 3021 NumberOfCodeBlocks, 3021 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5620 ConstructedInterpolants, 285 QuantifiedInterpolants, 6147507 SizeOfPredicates, 106 NumberOfNonLiveVariables, 6713 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 36 InterpolantComputations, 30 PerfectInterpolantSequences, 6863/7220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...