./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.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_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no XNF --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:37:22,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:37:22,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:37:22,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:37:22,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:37:22,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:37:22,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:37:22,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:37:22,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:37:22,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:37:22,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:37:22,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:37:22,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:37:22,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:37:22,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:37:22,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:37:22,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:37:22,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:37:22,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:37:22,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:37:22,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:37:22,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:37:22,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:37:22,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:37:22,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:37:22,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:37:22,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:37:22,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:37:22,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:37:22,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:37:22,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:37:22,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:37:22,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:37:22,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:37:22,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:37:22,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:37:22,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:37:22,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:37:22,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:37:22,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:37:22,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:37:22,835 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:37:22,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:37:22,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:37:22,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:37:22,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:37:22,860 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:37:22,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:37:22,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:37:22,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:37:22,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:37:22,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:37:22,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:37:22,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:37:22,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:37:22,863 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:37:22,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:37:22,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:37:22,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:37:22,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:37:22,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:37:22,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:37:22,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:37:22,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:37:22,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:37:22,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:37:22,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:37:22,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:37:22,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:37:22,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:37:22,865 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_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 -> a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 [2019-11-20 03:37:23,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:37:23,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:37:23,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:37:23,040 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:37:23,041 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:37:23,041 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-11-20 03:37:23,086 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data/91c6ce469/79c2759cb9504313a227dccb06359631/FLAGb6a593df6 [2019-11-20 03:37:23,631 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:37:23,631 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-11-20 03:37:23,657 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data/91c6ce469/79c2759cb9504313a227dccb06359631/FLAGb6a593df6 [2019-11-20 03:37:23,869 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data/91c6ce469/79c2759cb9504313a227dccb06359631 [2019-11-20 03:37:23,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:37:23,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:37:23,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:37:23,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:37:23,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:37:23,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:37:23" (1/1) ... [2019-11-20 03:37:23,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1ba59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:23, skipping insertion in model container [2019-11-20 03:37:23,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:37:23" (1/1) ... [2019-11-20 03:37:23,887 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:37:23,949 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:37:24,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:37:24,451 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:37:24,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:37:24,596 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:37:24,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24 WrapperNode [2019-11-20 03:37:24,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:37:24,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:37:24,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:37:24,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:37:24,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:37:24,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:37:24,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:37:24,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:37:24,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... [2019-11-20 03:37:24,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:37:24,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:37:24,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:37:24,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:37:24,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:37:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:37:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:37:24,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 03:37:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 03:37:24,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:37:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:37:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:37:24,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:37:25,209 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 03:37:26,164 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 03:37:26,164 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 03:37:26,165 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:37:26,166 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:37:26,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:37:26 BoogieIcfgContainer [2019-11-20 03:37:26,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:37:26,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:37:26,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:37:26,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:37:26,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:37:23" (1/3) ... [2019-11-20 03:37:26,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e99bf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:37:26, skipping insertion in model container [2019-11-20 03:37:26,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:37:24" (2/3) ... [2019-11-20 03:37:26,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e99bf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:37:26, skipping insertion in model container [2019-11-20 03:37:26,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:37:26" (3/3) ... [2019-11-20 03:37:26,174 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2019-11-20 03:37:26,182 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:37:26,188 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:37:26,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:37:26,219 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:37:26,219 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:37:26,219 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:37:26,219 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:37:26,220 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:37:26,220 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:37:26,220 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:37:26,220 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:37:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-11-20 03:37:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:37:26,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:26,246 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:26,246 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash 62050801, now seen corresponding path program 1 times [2019-11-20 03:37:26,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:26,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350920204] [2019-11-20 03:37:26,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:26,580 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 03:37:26,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350920204] [2019-11-20 03:37:26,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:26,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:26,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836458300] [2019-11-20 03:37:26,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:26,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:26,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:26,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:26,604 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2019-11-20 03:37:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:27,206 INFO L93 Difference]: Finished difference Result 325 states and 551 transitions. [2019-11-20 03:37:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:27,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-20 03:37:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:27,226 INFO L225 Difference]: With dead ends: 325 [2019-11-20 03:37:27,227 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 03:37:27,231 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 03:37:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 03:37:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-11-20 03:37:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 228 transitions. [2019-11-20 03:37:27,295 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 228 transitions. Word has length 43 [2019-11-20 03:37:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:27,296 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 228 transitions. [2019-11-20 03:37:27,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 228 transitions. [2019-11-20 03:37:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 03:37:27,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:27,305 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:27,306 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:27,306 INFO L82 PathProgramCache]: Analyzing trace with hash 96450622, now seen corresponding path program 1 times [2019-11-20 03:37:27,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:27,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12815675] [2019-11-20 03:37:27,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:27,469 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 03:37:27,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12815675] [2019-11-20 03:37:27,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:27,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:27,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9496706] [2019-11-20 03:37:27,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:27,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:27,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:27,473 INFO L87 Difference]: Start difference. First operand 147 states and 228 transitions. Second operand 4 states. [2019-11-20 03:37:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:27,853 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-11-20 03:37:27,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:27,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 03:37:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:27,856 INFO L225 Difference]: With dead ends: 292 [2019-11-20 03:37:27,856 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 03:37:27,858 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 03:37:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 03:37:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-11-20 03:37:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 227 transitions. [2019-11-20 03:37:27,868 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 227 transitions. Word has length 56 [2019-11-20 03:37:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:27,869 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 227 transitions. [2019-11-20 03:37:27,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 227 transitions. [2019-11-20 03:37:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 03:37:27,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:27,871 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:27,871 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1230157520, now seen corresponding path program 1 times [2019-11-20 03:37:27,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:27,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083782378] [2019-11-20 03:37:27,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:27,950 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 03:37:27,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083782378] [2019-11-20 03:37:27,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:27,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:27,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779998247] [2019-11-20 03:37:27,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:27,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:27,955 INFO L87 Difference]: Start difference. First operand 147 states and 227 transitions. Second operand 4 states. [2019-11-20 03:37:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:28,292 INFO L93 Difference]: Finished difference Result 291 states and 445 transitions. [2019-11-20 03:37:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:28,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 03:37:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:28,295 INFO L225 Difference]: With dead ends: 291 [2019-11-20 03:37:28,295 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 03:37:28,296 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 03:37:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 03:37:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2019-11-20 03:37:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2019-11-20 03:37:28,306 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 57 [2019-11-20 03:37:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:28,306 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2019-11-20 03:37:28,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2019-11-20 03:37:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 03:37:28,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:28,314 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:28,314 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash 261723899, now seen corresponding path program 1 times [2019-11-20 03:37:28,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:28,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992998554] [2019-11-20 03:37:28,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:28,410 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 03:37:28,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992998554] [2019-11-20 03:37:28,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:28,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:28,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837786123] [2019-11-20 03:37:28,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:28,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:28,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:28,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:28,413 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand 4 states. [2019-11-20 03:37:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:28,760 INFO L93 Difference]: Finished difference Result 289 states and 442 transitions. [2019-11-20 03:37:28,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:28,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 03:37:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:28,762 INFO L225 Difference]: With dead ends: 289 [2019-11-20 03:37:28,763 INFO L226 Difference]: Without dead ends: 161 [2019-11-20 03:37:28,763 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 03:37:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-20 03:37:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2019-11-20 03:37:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 225 transitions. [2019-11-20 03:37:28,784 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 225 transitions. Word has length 57 [2019-11-20 03:37:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:28,785 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 225 transitions. [2019-11-20 03:37:28,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 225 transitions. [2019-11-20 03:37:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 03:37:28,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:28,788 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:28,788 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:28,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:28,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2030023109, now seen corresponding path program 1 times [2019-11-20 03:37:28,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:28,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367419351] [2019-11-20 03:37:28,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:28,884 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 03:37:28,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367419351] [2019-11-20 03:37:28,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:28,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:28,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577881086] [2019-11-20 03:37:28,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:28,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:28,889 INFO L87 Difference]: Start difference. First operand 147 states and 225 transitions. Second operand 4 states. [2019-11-20 03:37:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:29,202 INFO L93 Difference]: Finished difference Result 288 states and 440 transitions. [2019-11-20 03:37:29,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:29,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 03:37:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:29,204 INFO L225 Difference]: With dead ends: 288 [2019-11-20 03:37:29,204 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 03:37:29,205 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 03:37:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 03:37:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-11-20 03:37:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions. [2019-11-20 03:37:29,221 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 57 [2019-11-20 03:37:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:29,222 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 224 transitions. [2019-11-20 03:37:29,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions. [2019-11-20 03:37:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 03:37:29,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:29,224 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:29,224 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:29,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1177906332, now seen corresponding path program 1 times [2019-11-20 03:37:29,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:29,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953027769] [2019-11-20 03:37:29,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:29,299 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 03:37:29,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953027769] [2019-11-20 03:37:29,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:29,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:29,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337065307] [2019-11-20 03:37:29,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:29,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:29,302 INFO L87 Difference]: Start difference. First operand 147 states and 224 transitions. Second operand 4 states. [2019-11-20 03:37:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:29,590 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2019-11-20 03:37:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:29,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 03:37:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:29,592 INFO L225 Difference]: With dead ends: 288 [2019-11-20 03:37:29,592 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 03:37:29,593 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 03:37:29,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 03:37:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-11-20 03:37:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 223 transitions. [2019-11-20 03:37:29,599 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 223 transitions. Word has length 57 [2019-11-20 03:37:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:29,599 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 223 transitions. [2019-11-20 03:37:29,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2019-11-20 03:37:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 03:37:29,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:29,600 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:29,601 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash -36846841, now seen corresponding path program 1 times [2019-11-20 03:37:29,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:29,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956786270] [2019-11-20 03:37:29,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:29,657 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 03:37:29,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956786270] [2019-11-20 03:37:29,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:29,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:29,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348781832] [2019-11-20 03:37:29,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:29,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:29,659 INFO L87 Difference]: Start difference. First operand 147 states and 223 transitions. Second operand 4 states. [2019-11-20 03:37:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:29,937 INFO L93 Difference]: Finished difference Result 288 states and 438 transitions. [2019-11-20 03:37:29,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:29,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 03:37:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:29,939 INFO L225 Difference]: With dead ends: 288 [2019-11-20 03:37:29,939 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 03:37:29,940 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 03:37:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 03:37:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-11-20 03:37:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2019-11-20 03:37:29,945 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 58 [2019-11-20 03:37:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:29,946 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2019-11-20 03:37:29,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2019-11-20 03:37:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 03:37:29,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:29,947 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:29,947 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2053945591, now seen corresponding path program 1 times [2019-11-20 03:37:29,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:29,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050349536] [2019-11-20 03:37:29,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:29,995 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 03:37:29,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050349536] [2019-11-20 03:37:29,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:29,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:29,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855916534] [2019-11-20 03:37:29,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:29,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:29,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:29,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:29,998 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2019-11-20 03:37:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:30,268 INFO L93 Difference]: Finished difference Result 288 states and 437 transitions. [2019-11-20 03:37:30,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:30,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 03:37:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:30,270 INFO L225 Difference]: With dead ends: 288 [2019-11-20 03:37:30,270 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 03:37:30,271 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 03:37:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 03:37:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-11-20 03:37:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2019-11-20 03:37:30,275 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 59 [2019-11-20 03:37:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:30,276 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2019-11-20 03:37:30,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2019-11-20 03:37:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 03:37:30,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:30,282 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:30,282 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:30,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1105265292, now seen corresponding path program 1 times [2019-11-20 03:37:30,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:30,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784674835] [2019-11-20 03:37:30,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:30,356 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 03:37:30,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784674835] [2019-11-20 03:37:30,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:30,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:30,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568547341] [2019-11-20 03:37:30,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:30,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:30,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:30,358 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 4 states. [2019-11-20 03:37:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:30,601 INFO L93 Difference]: Finished difference Result 278 states and 423 transitions. [2019-11-20 03:37:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:30,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 03:37:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:30,603 INFO L225 Difference]: With dead ends: 278 [2019-11-20 03:37:30,603 INFO L226 Difference]: Without dead ends: 150 [2019-11-20 03:37:30,604 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 03:37:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-20 03:37:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-11-20 03:37:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 03:37:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2019-11-20 03:37:30,608 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 220 transitions. Word has length 60 [2019-11-20 03:37:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:30,610 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 220 transitions. [2019-11-20 03:37:30,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 220 transitions. [2019-11-20 03:37:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 03:37:30,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:30,612 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, 1, 1] [2019-11-20 03:37:30,612 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash 493391860, now seen corresponding path program 1 times [2019-11-20 03:37:30,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:30,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847322117] [2019-11-20 03:37:30,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:30,677 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 03:37:30,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847322117] [2019-11-20 03:37:30,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:30,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:30,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375224787] [2019-11-20 03:37:30,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:30,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:30,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:30,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:30,683 INFO L87 Difference]: Start difference. First operand 147 states and 220 transitions. Second operand 4 states. [2019-11-20 03:37:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:31,021 INFO L93 Difference]: Finished difference Result 318 states and 484 transitions. [2019-11-20 03:37:31,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:31,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 03:37:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:31,023 INFO L225 Difference]: With dead ends: 318 [2019-11-20 03:37:31,023 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 03:37:31,024 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 03:37:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 03:37:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2019-11-20 03:37:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2019-11-20 03:37:31,030 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 60 [2019-11-20 03:37:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:31,030 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2019-11-20 03:37:31,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2019-11-20 03:37:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 03:37:31,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:31,031 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:31,031 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1533548315, now seen corresponding path program 1 times [2019-11-20 03:37:31,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:31,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398460860] [2019-11-20 03:37:31,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:31,078 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 03:37:31,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398460860] [2019-11-20 03:37:31,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:31,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:31,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531225933] [2019-11-20 03:37:31,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:31,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:31,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:31,081 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand 4 states. [2019-11-20 03:37:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:31,422 INFO L93 Difference]: Finished difference Result 340 states and 521 transitions. [2019-11-20 03:37:31,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:31,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 03:37:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:31,424 INFO L225 Difference]: With dead ends: 340 [2019-11-20 03:37:31,424 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 03:37:31,425 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 03:37:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 03:37:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2019-11-20 03:37:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2019-11-20 03:37:31,431 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 73 [2019-11-20 03:37:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:31,431 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2019-11-20 03:37:31,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2019-11-20 03:37:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:37:31,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:31,433 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:31,433 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1464454253, now seen corresponding path program 1 times [2019-11-20 03:37:31,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:31,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507854914] [2019-11-20 03:37:31,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:31,481 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 03:37:31,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507854914] [2019-11-20 03:37:31,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:31,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:31,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951318646] [2019-11-20 03:37:31,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:31,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:31,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:31,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:31,484 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand 4 states. [2019-11-20 03:37:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:31,849 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2019-11-20 03:37:31,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:31,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 03:37:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:31,851 INFO L225 Difference]: With dead ends: 339 [2019-11-20 03:37:31,851 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 03:37:31,852 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 03:37:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 03:37:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2019-11-20 03:37:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2019-11-20 03:37:31,857 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 74 [2019-11-20 03:37:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:31,858 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2019-11-20 03:37:31,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2019-11-20 03:37:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:37:31,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:31,859 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:31,859 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1862079422, now seen corresponding path program 1 times [2019-11-20 03:37:31,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:31,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749341520] [2019-11-20 03:37:31,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:31,916 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 03:37:31,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749341520] [2019-11-20 03:37:31,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:31,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:31,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43023982] [2019-11-20 03:37:31,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:31,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:31,919 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand 4 states. [2019-11-20 03:37:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:32,221 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-20 03:37:32,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:32,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 03:37:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:32,223 INFO L225 Difference]: With dead ends: 337 [2019-11-20 03:37:32,223 INFO L226 Difference]: Without dead ends: 187 [2019-11-20 03:37:32,224 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 03:37:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-20 03:37:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 169. [2019-11-20 03:37:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 255 transitions. [2019-11-20 03:37:32,228 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 255 transitions. Word has length 74 [2019-11-20 03:37:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:32,230 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 255 transitions. [2019-11-20 03:37:32,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 255 transitions. [2019-11-20 03:37:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:37:32,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:32,232 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:32,232 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash -429667586, now seen corresponding path program 1 times [2019-11-20 03:37:32,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:32,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515096750] [2019-11-20 03:37:32,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:32,284 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 03:37:32,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515096750] [2019-11-20 03:37:32,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:32,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:32,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477390461] [2019-11-20 03:37:32,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:32,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:32,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:32,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:32,288 INFO L87 Difference]: Start difference. First operand 169 states and 255 transitions. Second operand 4 states. [2019-11-20 03:37:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:32,563 INFO L93 Difference]: Finished difference Result 336 states and 511 transitions. [2019-11-20 03:37:32,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:32,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 03:37:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:32,565 INFO L225 Difference]: With dead ends: 336 [2019-11-20 03:37:32,565 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 03:37:32,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 03:37:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 03:37:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-20 03:37:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 254 transitions. [2019-11-20 03:37:32,572 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 254 transitions. Word has length 74 [2019-11-20 03:37:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:32,572 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 254 transitions. [2019-11-20 03:37:32,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 254 transitions. [2019-11-20 03:37:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:37:32,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:32,574 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:32,574 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:32,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash 422449191, now seen corresponding path program 1 times [2019-11-20 03:37:32,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:32,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831166121] [2019-11-20 03:37:32,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:32,617 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 03:37:32,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831166121] [2019-11-20 03:37:32,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:32,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:32,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514514767] [2019-11-20 03:37:32,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:32,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:32,619 INFO L87 Difference]: Start difference. First operand 169 states and 254 transitions. Second operand 4 states. [2019-11-20 03:37:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:32,921 INFO L93 Difference]: Finished difference Result 336 states and 509 transitions. [2019-11-20 03:37:32,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:32,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 03:37:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:32,923 INFO L225 Difference]: With dead ends: 336 [2019-11-20 03:37:32,923 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 03:37:32,923 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 03:37:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 03:37:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-20 03:37:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 253 transitions. [2019-11-20 03:37:32,930 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 253 transitions. Word has length 74 [2019-11-20 03:37:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:32,931 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 253 transitions. [2019-11-20 03:37:32,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 253 transitions. [2019-11-20 03:37:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 03:37:32,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:32,932 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:32,932 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:32,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1965433180, now seen corresponding path program 1 times [2019-11-20 03:37:32,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:32,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580651099] [2019-11-20 03:37:32,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:32,979 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 03:37:32,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580651099] [2019-11-20 03:37:32,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:32,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:32,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802732628] [2019-11-20 03:37:32,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:32,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:32,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:32,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:32,983 INFO L87 Difference]: Start difference. First operand 169 states and 253 transitions. Second operand 4 states. [2019-11-20 03:37:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:33,295 INFO L93 Difference]: Finished difference Result 336 states and 507 transitions. [2019-11-20 03:37:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:33,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 03:37:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:33,297 INFO L225 Difference]: With dead ends: 336 [2019-11-20 03:37:33,297 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 03:37:33,298 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 03:37:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 03:37:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-20 03:37:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2019-11-20 03:37:33,302 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 75 [2019-11-20 03:37:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:33,303 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-11-20 03:37:33,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2019-11-20 03:37:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 03:37:33,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:33,304 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:33,304 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1710579956, now seen corresponding path program 1 times [2019-11-20 03:37:33,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:33,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569056391] [2019-11-20 03:37:33,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:33,353 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 03:37:33,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569056391] [2019-11-20 03:37:33,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:33,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:33,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141864072] [2019-11-20 03:37:33,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:33,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:33,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:33,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:33,355 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand 4 states. [2019-11-20 03:37:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:33,650 INFO L93 Difference]: Finished difference Result 336 states and 505 transitions. [2019-11-20 03:37:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:33,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 03:37:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:33,652 INFO L225 Difference]: With dead ends: 336 [2019-11-20 03:37:33,652 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 03:37:33,653 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 03:37:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 03:37:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-20 03:37:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2019-11-20 03:37:33,658 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 76 [2019-11-20 03:37:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:33,659 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2019-11-20 03:37:33,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2019-11-20 03:37:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 03:37:33,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:33,660 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:33,660 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1135301911, now seen corresponding path program 1 times [2019-11-20 03:37:33,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:33,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415493801] [2019-11-20 03:37:33,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:33,716 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 03:37:33,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415493801] [2019-11-20 03:37:33,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:33,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:33,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066900574] [2019-11-20 03:37:33,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:33,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:33,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:33,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:33,718 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 4 states. [2019-11-20 03:37:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:34,020 INFO L93 Difference]: Finished difference Result 326 states and 490 transitions. [2019-11-20 03:37:34,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:34,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-20 03:37:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:34,022 INFO L225 Difference]: With dead ends: 326 [2019-11-20 03:37:34,022 INFO L226 Difference]: Without dead ends: 176 [2019-11-20 03:37:34,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 03:37:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-20 03:37:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2019-11-20 03:37:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-20 03:37:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2019-11-20 03:37:34,027 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 77 [2019-11-20 03:37:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:34,027 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2019-11-20 03:37:34,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2019-11-20 03:37:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 03:37:34,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:34,028 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, 1] [2019-11-20 03:37:34,029 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:34,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1507827117, now seen corresponding path program 1 times [2019-11-20 03:37:34,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:34,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667255450] [2019-11-20 03:37:34,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:34,115 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 03:37:34,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667255450] [2019-11-20 03:37:34,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:34,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:34,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262040315] [2019-11-20 03:37:34,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:34,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:34,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:34,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:34,118 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 4 states. [2019-11-20 03:37:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:34,517 INFO L93 Difference]: Finished difference Result 427 states and 645 transitions. [2019-11-20 03:37:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:34,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-20 03:37:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:34,520 INFO L225 Difference]: With dead ends: 427 [2019-11-20 03:37:34,520 INFO L226 Difference]: Without dead ends: 277 [2019-11-20 03:37:34,520 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 03:37:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-20 03:37:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 210. [2019-11-20 03:37:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-20 03:37:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 324 transitions. [2019-11-20 03:37:34,529 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 324 transitions. Word has length 82 [2019-11-20 03:37:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:34,530 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 324 transitions. [2019-11-20 03:37:34,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2019-11-20 03:37:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 03:37:34,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:34,531 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, 1] [2019-11-20 03:37:34,531 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:34,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1931473839, now seen corresponding path program 1 times [2019-11-20 03:37:34,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:34,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830896375] [2019-11-20 03:37:34,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:34,595 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 03:37:34,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830896375] [2019-11-20 03:37:34,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:34,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:34,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911554540] [2019-11-20 03:37:34,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:34,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:34,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:34,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:34,598 INFO L87 Difference]: Start difference. First operand 210 states and 324 transitions. Second operand 4 states. [2019-11-20 03:37:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:34,932 INFO L93 Difference]: Finished difference Result 450 states and 701 transitions. [2019-11-20 03:37:34,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:34,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-20 03:37:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:34,935 INFO L225 Difference]: With dead ends: 450 [2019-11-20 03:37:34,935 INFO L226 Difference]: Without dead ends: 259 [2019-11-20 03:37:34,936 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 03:37:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-20 03:37:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2019-11-20 03:37:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 03:37:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 366 transitions. [2019-11-20 03:37:34,946 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 366 transitions. Word has length 82 [2019-11-20 03:37:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:34,947 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 366 transitions. [2019-11-20 03:37:34,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 366 transitions. [2019-11-20 03:37:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 03:37:34,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:34,948 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, 1, 1] [2019-11-20 03:37:34,949 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:34,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:34,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1813377491, now seen corresponding path program 1 times [2019-11-20 03:37:34,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:34,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029681224] [2019-11-20 03:37:34,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:35,062 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 03:37:35,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029681224] [2019-11-20 03:37:35,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:35,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:35,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59344050] [2019-11-20 03:37:35,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:35,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:35,065 INFO L87 Difference]: Start difference. First operand 234 states and 366 transitions. Second operand 4 states. [2019-11-20 03:37:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:35,530 INFO L93 Difference]: Finished difference Result 508 states and 791 transitions. [2019-11-20 03:37:35,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:35,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-20 03:37:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:35,533 INFO L225 Difference]: With dead ends: 508 [2019-11-20 03:37:35,533 INFO L226 Difference]: Without dead ends: 293 [2019-11-20 03:37:35,533 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 03:37:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-20 03:37:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 235. [2019-11-20 03:37:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-20 03:37:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 367 transitions. [2019-11-20 03:37:35,539 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 367 transitions. Word has length 83 [2019-11-20 03:37:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:35,540 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 367 transitions. [2019-11-20 03:37:35,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 367 transitions. [2019-11-20 03:37:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 03:37:35,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:35,541 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:35,542 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash -724247038, now seen corresponding path program 1 times [2019-11-20 03:37:35,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:35,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222185771] [2019-11-20 03:37:35,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:35,607 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 03:37:35,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222185771] [2019-11-20 03:37:35,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:35,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:35,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503826581] [2019-11-20 03:37:35,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:35,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:35,609 INFO L87 Difference]: Start difference. First operand 235 states and 367 transitions. Second operand 4 states. [2019-11-20 03:37:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:35,994 INFO L93 Difference]: Finished difference Result 509 states and 791 transitions. [2019-11-20 03:37:35,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:35,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 03:37:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:35,997 INFO L225 Difference]: With dead ends: 509 [2019-11-20 03:37:35,997 INFO L226 Difference]: Without dead ends: 293 [2019-11-20 03:37:35,998 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 03:37:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-20 03:37:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 235. [2019-11-20 03:37:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-20 03:37:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 366 transitions. [2019-11-20 03:37:36,004 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 366 transitions. Word has length 95 [2019-11-20 03:37:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:36,004 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 366 transitions. [2019-11-20 03:37:36,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 366 transitions. [2019-11-20 03:37:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 03:37:36,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:36,006 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:36,006 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:36,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:36,006 INFO L82 PathProgramCache]: Analyzing trace with hash 151771968, now seen corresponding path program 1 times [2019-11-20 03:37:36,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:36,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880909102] [2019-11-20 03:37:36,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:36,065 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 03:37:36,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880909102] [2019-11-20 03:37:36,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:36,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:36,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785778719] [2019-11-20 03:37:36,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:36,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:36,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:36,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:36,068 INFO L87 Difference]: Start difference. First operand 235 states and 366 transitions. Second operand 4 states. [2019-11-20 03:37:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:36,346 INFO L93 Difference]: Finished difference Result 476 states and 742 transitions. [2019-11-20 03:37:36,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:36,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 03:37:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:36,349 INFO L225 Difference]: With dead ends: 476 [2019-11-20 03:37:36,349 INFO L226 Difference]: Without dead ends: 260 [2019-11-20 03:37:36,349 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 03:37:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-20 03:37:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 235. [2019-11-20 03:37:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-20 03:37:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 365 transitions. [2019-11-20 03:37:36,355 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 365 transitions. Word has length 95 [2019-11-20 03:37:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:36,356 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 365 transitions. [2019-11-20 03:37:36,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 365 transitions. [2019-11-20 03:37:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 03:37:36,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:36,357 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:36,357 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1558333836, now seen corresponding path program 1 times [2019-11-20 03:37:36,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:36,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957200024] [2019-11-20 03:37:36,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:36,416 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 03:37:36,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957200024] [2019-11-20 03:37:36,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:36,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:36,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374511390] [2019-11-20 03:37:36,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:36,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:36,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:36,418 INFO L87 Difference]: Start difference. First operand 235 states and 365 transitions. Second operand 4 states. [2019-11-20 03:37:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:36,853 INFO L93 Difference]: Finished difference Result 508 states and 786 transitions. [2019-11-20 03:37:36,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:36,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 03:37:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:36,856 INFO L225 Difference]: With dead ends: 508 [2019-11-20 03:37:36,856 INFO L226 Difference]: Without dead ends: 292 [2019-11-20 03:37:36,856 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 03:37:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-20 03:37:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 235. [2019-11-20 03:37:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-20 03:37:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 364 transitions. [2019-11-20 03:37:36,862 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 364 transitions. Word has length 96 [2019-11-20 03:37:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:36,863 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 364 transitions. [2019-11-20 03:37:36,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 364 transitions. [2019-11-20 03:37:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 03:37:36,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:36,864 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:36,864 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:36,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:36,864 INFO L82 PathProgramCache]: Analyzing trace with hash 589900215, now seen corresponding path program 1 times [2019-11-20 03:37:36,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:36,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330599483] [2019-11-20 03:37:36,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:36,919 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 03:37:36,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330599483] [2019-11-20 03:37:36,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:36,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:36,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642210904] [2019-11-20 03:37:36,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:36,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:36,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:36,921 INFO L87 Difference]: Start difference. First operand 235 states and 364 transitions. Second operand 4 states. [2019-11-20 03:37:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:37,355 INFO L93 Difference]: Finished difference Result 506 states and 782 transitions. [2019-11-20 03:37:37,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:37,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 03:37:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:37,357 INFO L225 Difference]: With dead ends: 506 [2019-11-20 03:37:37,357 INFO L226 Difference]: Without dead ends: 290 [2019-11-20 03:37:37,358 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 03:37:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-20 03:37:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 235. [2019-11-20 03:37:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-20 03:37:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 363 transitions. [2019-11-20 03:37:37,364 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 363 transitions. Word has length 96 [2019-11-20 03:37:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:37,364 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 363 transitions. [2019-11-20 03:37:37,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 363 transitions. [2019-11-20 03:37:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 03:37:37,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:37,367 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:37,367 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1701846793, now seen corresponding path program 1 times [2019-11-20 03:37:37,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:37,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593921041] [2019-11-20 03:37:37,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:37,429 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 03:37:37,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593921041] [2019-11-20 03:37:37,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:37,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:37,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456437405] [2019-11-20 03:37:37,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:37,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:37,431 INFO L87 Difference]: Start difference. First operand 235 states and 363 transitions. Second operand 4 states. [2019-11-20 03:37:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:37,822 INFO L93 Difference]: Finished difference Result 505 states and 779 transitions. [2019-11-20 03:37:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:37,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 03:37:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:37,824 INFO L225 Difference]: With dead ends: 505 [2019-11-20 03:37:37,824 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 03:37:37,825 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 03:37:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 03:37:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 235. [2019-11-20 03:37:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-20 03:37:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 362 transitions. [2019-11-20 03:37:37,832 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 362 transitions. Word has length 96 [2019-11-20 03:37:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:37,833 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 362 transitions. [2019-11-20 03:37:37,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2019-11-20 03:37:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 03:37:37,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:37,834 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:37,834 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash -849730016, now seen corresponding path program 1 times [2019-11-20 03:37:37,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:37,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417482074] [2019-11-20 03:37:37,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:37,902 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 03:37:37,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417482074] [2019-11-20 03:37:37,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:37,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:37:37,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693433799] [2019-11-20 03:37:37,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:37:37,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:37,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:37:37,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:37:37,904 INFO L87 Difference]: Start difference. First operand 235 states and 362 transitions. Second operand 5 states. [2019-11-20 03:37:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:38,417 INFO L93 Difference]: Finished difference Result 472 states and 732 transitions. [2019-11-20 03:37:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:37:38,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-20 03:37:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:38,419 INFO L225 Difference]: With dead ends: 472 [2019-11-20 03:37:38,419 INFO L226 Difference]: Without dead ends: 256 [2019-11-20 03:37:38,420 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 03:37:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-20 03:37:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2019-11-20 03:37:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 388 transitions. [2019-11-20 03:37:38,427 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 388 transitions. Word has length 96 [2019-11-20 03:37:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:38,427 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 388 transitions. [2019-11-20 03:37:38,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:37:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 388 transitions. [2019-11-20 03:37:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 03:37:38,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:38,429 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:38,429 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:38,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1976685625, now seen corresponding path program 1 times [2019-11-20 03:37:38,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:38,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831723630] [2019-11-20 03:37:38,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:38,495 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 03:37:38,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831723630] [2019-11-20 03:37:38,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:38,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:38,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345431461] [2019-11-20 03:37:38,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:38,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:38,497 INFO L87 Difference]: Start difference. First operand 255 states and 388 transitions. Second operand 4 states. [2019-11-20 03:37:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:38,829 INFO L93 Difference]: Finished difference Result 513 states and 782 transitions. [2019-11-20 03:37:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:38,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 03:37:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:38,831 INFO L225 Difference]: With dead ends: 513 [2019-11-20 03:37:38,831 INFO L226 Difference]: Without dead ends: 277 [2019-11-20 03:37:38,832 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 03:37:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-20 03:37:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 255. [2019-11-20 03:37:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 387 transitions. [2019-11-20 03:37:38,839 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 387 transitions. Word has length 96 [2019-11-20 03:37:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:38,839 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 387 transitions. [2019-11-20 03:37:38,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2019-11-20 03:37:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 03:37:38,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:38,840 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:38,841 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:38,841 INFO L82 PathProgramCache]: Analyzing trace with hash -315061383, now seen corresponding path program 1 times [2019-11-20 03:37:38,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:38,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766384492] [2019-11-20 03:37:38,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:38,899 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 03:37:38,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766384492] [2019-11-20 03:37:38,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:38,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:38,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179801126] [2019-11-20 03:37:38,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:38,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:38,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:38,901 INFO L87 Difference]: Start difference. First operand 255 states and 387 transitions. Second operand 4 states. [2019-11-20 03:37:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:39,220 INFO L93 Difference]: Finished difference Result 512 states and 779 transitions. [2019-11-20 03:37:39,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:39,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 03:37:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:39,223 INFO L225 Difference]: With dead ends: 512 [2019-11-20 03:37:39,223 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 03:37:39,223 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 03:37:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 03:37:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-11-20 03:37:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 386 transitions. [2019-11-20 03:37:39,232 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 386 transitions. Word has length 96 [2019-11-20 03:37:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:39,232 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 386 transitions. [2019-11-20 03:37:39,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 386 transitions. [2019-11-20 03:37:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 03:37:39,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:39,233 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:39,234 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:39,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:39,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2085923458, now seen corresponding path program 1 times [2019-11-20 03:37:39,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:39,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725503705] [2019-11-20 03:37:39,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:39,286 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 03:37:39,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725503705] [2019-11-20 03:37:39,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:39,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:39,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042309915] [2019-11-20 03:37:39,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:39,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:39,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:39,288 INFO L87 Difference]: Start difference. First operand 255 states and 386 transitions. Second operand 4 states. [2019-11-20 03:37:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:39,594 INFO L93 Difference]: Finished difference Result 545 states and 824 transitions. [2019-11-20 03:37:39,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:39,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 03:37:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:39,596 INFO L225 Difference]: With dead ends: 545 [2019-11-20 03:37:39,596 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 03:37:39,597 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 03:37:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 03:37:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-11-20 03:37:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 385 transitions. [2019-11-20 03:37:39,604 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 385 transitions. Word has length 97 [2019-11-20 03:37:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:39,604 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 385 transitions. [2019-11-20 03:37:39,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 385 transitions. [2019-11-20 03:37:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 03:37:39,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:39,606 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:39,606 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:39,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:39,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2045248708, now seen corresponding path program 1 times [2019-11-20 03:37:39,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:39,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337314753] [2019-11-20 03:37:39,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:39,661 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 03:37:39,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337314753] [2019-11-20 03:37:39,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:39,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:39,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57257396] [2019-11-20 03:37:39,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:39,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:39,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:39,663 INFO L87 Difference]: Start difference. First operand 255 states and 385 transitions. Second operand 4 states. [2019-11-20 03:37:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:39,967 INFO L93 Difference]: Finished difference Result 512 states and 775 transitions. [2019-11-20 03:37:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:39,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 03:37:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:39,969 INFO L225 Difference]: With dead ends: 512 [2019-11-20 03:37:39,969 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 03:37:39,969 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 03:37:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 03:37:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-11-20 03:37:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 384 transitions. [2019-11-20 03:37:39,976 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 384 transitions. Word has length 97 [2019-11-20 03:37:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:39,976 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 384 transitions. [2019-11-20 03:37:39,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 384 transitions. [2019-11-20 03:37:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 03:37:39,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:39,978 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:39,978 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:39,978 INFO L82 PathProgramCache]: Analyzing trace with hash -811521741, now seen corresponding path program 1 times [2019-11-20 03:37:39,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:39,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781334263] [2019-11-20 03:37:39,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:40,037 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 03:37:40,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781334263] [2019-11-20 03:37:40,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:40,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:40,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64524917] [2019-11-20 03:37:40,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:40,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:40,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:40,039 INFO L87 Difference]: Start difference. First operand 255 states and 384 transitions. Second operand 4 states. [2019-11-20 03:37:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:40,458 INFO L93 Difference]: Finished difference Result 545 states and 820 transitions. [2019-11-20 03:37:40,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:40,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 03:37:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:40,460 INFO L225 Difference]: With dead ends: 545 [2019-11-20 03:37:40,460 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 03:37:40,461 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 03:37:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 03:37:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-11-20 03:37:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 383 transitions. [2019-11-20 03:37:40,468 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 383 transitions. Word has length 98 [2019-11-20 03:37:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:40,468 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 383 transitions. [2019-11-20 03:37:40,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 383 transitions. [2019-11-20 03:37:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 03:37:40,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:40,473 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:40,473 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 449395509, now seen corresponding path program 1 times [2019-11-20 03:37:40,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:40,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147001103] [2019-11-20 03:37:40,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:40,524 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 03:37:40,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147001103] [2019-11-20 03:37:40,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:40,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:40,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607844416] [2019-11-20 03:37:40,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:40,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:40,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:40,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:40,526 INFO L87 Difference]: Start difference. First operand 255 states and 383 transitions. Second operand 4 states. [2019-11-20 03:37:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:40,812 INFO L93 Difference]: Finished difference Result 512 states and 771 transitions. [2019-11-20 03:37:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:40,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 03:37:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:40,814 INFO L225 Difference]: With dead ends: 512 [2019-11-20 03:37:40,814 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 03:37:40,814 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 03:37:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 03:37:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-11-20 03:37:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 382 transitions. [2019-11-20 03:37:40,820 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 382 transitions. Word has length 98 [2019-11-20 03:37:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:40,821 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 382 transitions. [2019-11-20 03:37:40,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 382 transitions. [2019-11-20 03:37:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 03:37:40,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:40,822 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:40,823 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:40,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash 593163641, now seen corresponding path program 1 times [2019-11-20 03:37:40,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:40,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261106317] [2019-11-20 03:37:40,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:40,879 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 03:37:40,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261106317] [2019-11-20 03:37:40,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:40,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:40,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599860014] [2019-11-20 03:37:40,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:40,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:40,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:40,881 INFO L87 Difference]: Start difference. First operand 255 states and 382 transitions. Second operand 4 states. [2019-11-20 03:37:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:41,208 INFO L93 Difference]: Finished difference Result 545 states and 816 transitions. [2019-11-20 03:37:41,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:41,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 03:37:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:41,210 INFO L225 Difference]: With dead ends: 545 [2019-11-20 03:37:41,210 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 03:37:41,210 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 03:37:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 03:37:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-11-20 03:37:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 381 transitions. [2019-11-20 03:37:41,218 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 381 transitions. Word has length 99 [2019-11-20 03:37:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:41,218 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 381 transitions. [2019-11-20 03:37:41,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 381 transitions. [2019-11-20 03:37:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 03:37:41,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:41,219 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:41,219 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:41,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1026892727, now seen corresponding path program 1 times [2019-11-20 03:37:41,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:41,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680940822] [2019-11-20 03:37:41,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:41,285 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 03:37:41,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680940822] [2019-11-20 03:37:41,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:41,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:41,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512885419] [2019-11-20 03:37:41,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:41,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:41,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:41,287 INFO L87 Difference]: Start difference. First operand 255 states and 381 transitions. Second operand 4 states. [2019-11-20 03:37:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:41,568 INFO L93 Difference]: Finished difference Result 512 states and 767 transitions. [2019-11-20 03:37:41,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:41,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 03:37:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:41,569 INFO L225 Difference]: With dead ends: 512 [2019-11-20 03:37:41,569 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 03:37:41,570 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 03:37:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 03:37:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-11-20 03:37:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 380 transitions. [2019-11-20 03:37:41,578 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 380 transitions. Word has length 99 [2019-11-20 03:37:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:41,579 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 380 transitions. [2019-11-20 03:37:41,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 380 transitions. [2019-11-20 03:37:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 03:37:41,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:41,580 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:41,581 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1741675342, now seen corresponding path program 1 times [2019-11-20 03:37:41,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:41,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265796443] [2019-11-20 03:37:41,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:41,690 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 03:37:41,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265796443] [2019-11-20 03:37:41,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:41,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:41,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301207118] [2019-11-20 03:37:41,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:41,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:41,692 INFO L87 Difference]: Start difference. First operand 255 states and 380 transitions. Second operand 4 states. [2019-11-20 03:37:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:42,079 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-11-20 03:37:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:42,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 03:37:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:42,081 INFO L225 Difference]: With dead ends: 535 [2019-11-20 03:37:42,081 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 03:37:42,081 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 03:37:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 03:37:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-11-20 03:37:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 379 transitions. [2019-11-20 03:37:42,089 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 379 transitions. Word has length 100 [2019-11-20 03:37:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:42,089 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 379 transitions. [2019-11-20 03:37:42,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 379 transitions. [2019-11-20 03:37:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 03:37:42,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:42,090 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:42,090 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1992592176, now seen corresponding path program 1 times [2019-11-20 03:37:42,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:42,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488700872] [2019-11-20 03:37:42,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:42,146 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 03:37:42,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488700872] [2019-11-20 03:37:42,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:42,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:42,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782381062] [2019-11-20 03:37:42,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:42,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:42,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:42,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:42,148 INFO L87 Difference]: Start difference. First operand 255 states and 379 transitions. Second operand 4 states. [2019-11-20 03:37:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:42,448 INFO L93 Difference]: Finished difference Result 502 states and 751 transitions. [2019-11-20 03:37:42,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:42,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 03:37:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:42,451 INFO L225 Difference]: With dead ends: 502 [2019-11-20 03:37:42,451 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 03:37:42,451 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 03:37:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 03:37:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 255. [2019-11-20 03:37:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 378 transitions. [2019-11-20 03:37:42,458 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 378 transitions. Word has length 100 [2019-11-20 03:37:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:42,459 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 378 transitions. [2019-11-20 03:37:42,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 378 transitions. [2019-11-20 03:37:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:37:42,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:42,460 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 03:37:42,460 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:42,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash -368689638, now seen corresponding path program 1 times [2019-11-20 03:37:42,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:42,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381934573] [2019-11-20 03:37:42,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:42,514 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 03:37:42,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381934573] [2019-11-20 03:37:42,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:42,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:42,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097178367] [2019-11-20 03:37:42,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:42,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:42,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:42,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:42,516 INFO L87 Difference]: Start difference. First operand 255 states and 378 transitions. Second operand 4 states. [2019-11-20 03:37:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:42,883 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-11-20 03:37:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:42,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-20 03:37:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:42,885 INFO L225 Difference]: With dead ends: 535 [2019-11-20 03:37:42,885 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 03:37:42,886 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 03:37:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 03:37:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-11-20 03:37:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-20 03:37:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 377 transitions. [2019-11-20 03:37:42,895 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 377 transitions. Word has length 104 [2019-11-20 03:37:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:42,896 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 377 transitions. [2019-11-20 03:37:42,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 377 transitions. [2019-11-20 03:37:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 03:37:42,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:42,897 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 03:37:42,898 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash -786086244, now seen corresponding path program 1 times [2019-11-20 03:37:42,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:42,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87409336] [2019-11-20 03:37:42,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:42,949 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 03:37:42,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87409336] [2019-11-20 03:37:42,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:42,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:37:42,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172580145] [2019-11-20 03:37:42,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:37:42,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:42,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:37:42,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:37:42,951 INFO L87 Difference]: Start difference. First operand 255 states and 377 transitions. Second operand 3 states. [2019-11-20 03:37:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:43,008 INFO L93 Difference]: Finished difference Result 725 states and 1086 transitions. [2019-11-20 03:37:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:37:43,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 03:37:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:43,012 INFO L225 Difference]: With dead ends: 725 [2019-11-20 03:37:43,012 INFO L226 Difference]: Without dead ends: 489 [2019-11-20 03:37:43,012 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 03:37:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-20 03:37:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-11-20 03:37:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-11-20 03:37:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 723 transitions. [2019-11-20 03:37:43,025 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 723 transitions. Word has length 104 [2019-11-20 03:37:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:43,025 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 723 transitions. [2019-11-20 03:37:43,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:37:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 723 transitions. [2019-11-20 03:37:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 03:37:43,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:43,027 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, 1, 1] [2019-11-20 03:37:43,027 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:43,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1514654609, now seen corresponding path program 1 times [2019-11-20 03:37:43,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:43,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662225637] [2019-11-20 03:37:43,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:43,086 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 03:37:43,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662225637] [2019-11-20 03:37:43,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:43,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:37:43,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845078736] [2019-11-20 03:37:43,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:37:43,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:43,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:37:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:37:43,090 INFO L87 Difference]: Start difference. First operand 489 states and 723 transitions. Second operand 3 states. [2019-11-20 03:37:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:43,150 INFO L93 Difference]: Finished difference Result 1193 states and 1778 transitions. [2019-11-20 03:37:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:37:43,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-20 03:37:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:43,154 INFO L225 Difference]: With dead ends: 1193 [2019-11-20 03:37:43,154 INFO L226 Difference]: Without dead ends: 723 [2019-11-20 03:37:43,155 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 03:37:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-20 03:37:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-11-20 03:37:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-20 03:37:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1070 transitions. [2019-11-20 03:37:43,175 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1070 transitions. Word has length 123 [2019-11-20 03:37:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:43,175 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1070 transitions. [2019-11-20 03:37:43,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:37:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1070 transitions. [2019-11-20 03:37:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-20 03:37:43,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:43,178 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, 1, 1] [2019-11-20 03:37:43,178 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash -933599837, now seen corresponding path program 1 times [2019-11-20 03:37:43,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:43,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115199061] [2019-11-20 03:37:43,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-20 03:37:43,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115199061] [2019-11-20 03:37:43,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:43,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:37:43,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121530580] [2019-11-20 03:37:43,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:37:43,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:43,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:37:43,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:37:43,265 INFO L87 Difference]: Start difference. First operand 723 states and 1070 transitions. Second operand 3 states. [2019-11-20 03:37:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:43,337 INFO L93 Difference]: Finished difference Result 1655 states and 2463 transitions. [2019-11-20 03:37:43,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:37:43,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-20 03:37:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:43,342 INFO L225 Difference]: With dead ends: 1655 [2019-11-20 03:37:43,342 INFO L226 Difference]: Without dead ends: 951 [2019-11-20 03:37:43,344 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 03:37:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-11-20 03:37:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2019-11-20 03:37:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-11-20 03:37:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1406 transitions. [2019-11-20 03:37:43,375 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1406 transitions. Word has length 166 [2019-11-20 03:37:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:43,375 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1406 transitions. [2019-11-20 03:37:43,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:37:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1406 transitions. [2019-11-20 03:37:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-20 03:37:43,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:43,378 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, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:37:43,379 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:43,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:43,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1664913724, now seen corresponding path program 1 times [2019-11-20 03:37:43,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:43,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745978827] [2019-11-20 03:37:43,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-20 03:37:43,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745978827] [2019-11-20 03:37:43,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:43,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:37:43,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352602574] [2019-11-20 03:37:43,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:37:43,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:37:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:37:43,483 INFO L87 Difference]: Start difference. First operand 951 states and 1406 transitions. Second operand 3 states. [2019-11-20 03:37:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:43,557 INFO L93 Difference]: Finished difference Result 2117 states and 3144 transitions. [2019-11-20 03:37:43,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:37:43,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-20 03:37:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:43,564 INFO L225 Difference]: With dead ends: 2117 [2019-11-20 03:37:43,564 INFO L226 Difference]: Without dead ends: 1185 [2019-11-20 03:37:43,565 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 03:37:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-11-20 03:37:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-11-20 03:37:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-20 03:37:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1755 transitions. [2019-11-20 03:37:43,598 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1755 transitions. Word has length 205 [2019-11-20 03:37:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:43,598 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1755 transitions. [2019-11-20 03:37:43,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:37:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1755 transitions. [2019-11-20 03:37:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-20 03:37:43,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:43,602 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 03:37:43,602 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1064030038, now seen corresponding path program 1 times [2019-11-20 03:37:43,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:43,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608674929] [2019-11-20 03:37:43,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-20 03:37:43,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608674929] [2019-11-20 03:37:43,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:43,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:37:43,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139969763] [2019-11-20 03:37:43,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:37:43,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:37:43,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:37:43,744 INFO L87 Difference]: Start difference. First operand 1185 states and 1755 transitions. Second operand 3 states. [2019-11-20 03:37:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:43,866 INFO L93 Difference]: Finished difference Result 2585 states and 3842 transitions. [2019-11-20 03:37:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:37:43,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-11-20 03:37:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:43,874 INFO L225 Difference]: With dead ends: 2585 [2019-11-20 03:37:43,874 INFO L226 Difference]: Without dead ends: 1419 [2019-11-20 03:37:43,877 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 03:37:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-11-20 03:37:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1419. [2019-11-20 03:37:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-20 03:37:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2105 transitions. [2019-11-20 03:37:43,915 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2105 transitions. Word has length 247 [2019-11-20 03:37:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:43,916 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2105 transitions. [2019-11-20 03:37:43,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:37:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2105 transitions. [2019-11-20 03:37:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-20 03:37:43,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:43,922 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:43,922 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2059484962, now seen corresponding path program 1 times [2019-11-20 03:37:43,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:43,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138858044] [2019-11-20 03:37:43,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-20 03:37:44,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138858044] [2019-11-20 03:37:44,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:44,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:44,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111346607] [2019-11-20 03:37:44,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:44,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:44,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:44,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:44,109 INFO L87 Difference]: Start difference. First operand 1419 states and 2105 transitions. Second operand 4 states. [2019-11-20 03:37:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:44,653 INFO L93 Difference]: Finished difference Result 3435 states and 5124 transitions. [2019-11-20 03:37:44,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:44,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-20 03:37:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:44,664 INFO L225 Difference]: With dead ends: 3435 [2019-11-20 03:37:44,664 INFO L226 Difference]: Without dead ends: 2035 [2019-11-20 03:37:44,666 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 03:37:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2019-11-20 03:37:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1665. [2019-11-20 03:37:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-11-20 03:37:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2555 transitions. [2019-11-20 03:37:44,717 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2555 transitions. Word has length 291 [2019-11-20 03:37:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:44,717 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 2555 transitions. [2019-11-20 03:37:44,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2555 transitions. [2019-11-20 03:37:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-20 03:37:44,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:44,722 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:44,722 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1624979364, now seen corresponding path program 1 times [2019-11-20 03:37:44,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:44,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792505983] [2019-11-20 03:37:44,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-20 03:37:44,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792505983] [2019-11-20 03:37:44,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:44,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:37:44,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438236363] [2019-11-20 03:37:44,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:37:44,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:44,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:37:44,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:37:44,864 INFO L87 Difference]: Start difference. First operand 1665 states and 2555 transitions. Second operand 3 states. [2019-11-20 03:37:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:44,973 INFO L93 Difference]: Finished difference Result 3581 states and 5510 transitions. [2019-11-20 03:37:44,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:37:44,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2019-11-20 03:37:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:44,983 INFO L225 Difference]: With dead ends: 3581 [2019-11-20 03:37:44,983 INFO L226 Difference]: Without dead ends: 1935 [2019-11-20 03:37:44,985 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 03:37:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-11-20 03:37:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-11-20 03:37:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-20 03:37:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2967 transitions. [2019-11-20 03:37:45,046 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2967 transitions. Word has length 291 [2019-11-20 03:37:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:45,047 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2967 transitions. [2019-11-20 03:37:45,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:37:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2967 transitions. [2019-11-20 03:37:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-20 03:37:45,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:45,053 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:45,053 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:45,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1789083782, now seen corresponding path program 1 times [2019-11-20 03:37:45,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:45,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561295325] [2019-11-20 03:37:45,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-11-20 03:37:45,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561295325] [2019-11-20 03:37:45,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:45,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:37:45,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648571530] [2019-11-20 03:37:45,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:37:45,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:45,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:37:45,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:37:45,210 INFO L87 Difference]: Start difference. First operand 1935 states and 2967 transitions. Second operand 3 states. [2019-11-20 03:37:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:45,313 INFO L93 Difference]: Finished difference Result 4126 states and 6341 transitions. [2019-11-20 03:37:45,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:37:45,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-11-20 03:37:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:45,325 INFO L225 Difference]: With dead ends: 4126 [2019-11-20 03:37:45,326 INFO L226 Difference]: Without dead ends: 2210 [2019-11-20 03:37:45,328 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 03:37:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-11-20 03:37:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2210. [2019-11-20 03:37:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2210 states. [2019-11-20 03:37:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 3394 transitions. [2019-11-20 03:37:45,405 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 3394 transitions. Word has length 331 [2019-11-20 03:37:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:45,406 INFO L462 AbstractCegarLoop]: Abstraction has 2210 states and 3394 transitions. [2019-11-20 03:37:45,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:37:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 3394 transitions. [2019-11-20 03:37:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-11-20 03:37:45,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:45,414 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:45,414 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1353737935, now seen corresponding path program 1 times [2019-11-20 03:37:45,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:45,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755654678] [2019-11-20 03:37:45,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-11-20 03:37:45,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755654678] [2019-11-20 03:37:45,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:45,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:37:45,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457978014] [2019-11-20 03:37:45,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:37:45,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:37:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:37:45,683 INFO L87 Difference]: Start difference. First operand 2210 states and 3394 transitions. Second operand 3 states. [2019-11-20 03:37:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:45,770 INFO L93 Difference]: Finished difference Result 2487 states and 3824 transitions. [2019-11-20 03:37:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:37:45,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-11-20 03:37:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:45,783 INFO L225 Difference]: With dead ends: 2487 [2019-11-20 03:37:45,783 INFO L226 Difference]: Without dead ends: 2485 [2019-11-20 03:37:45,784 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 03:37:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2019-11-20 03:37:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2485. [2019-11-20 03:37:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2019-11-20 03:37:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3822 transitions. [2019-11-20 03:37:45,850 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3822 transitions. Word has length 374 [2019-11-20 03:37:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:45,851 INFO L462 AbstractCegarLoop]: Abstraction has 2485 states and 3822 transitions. [2019-11-20 03:37:45,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:37:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3822 transitions. [2019-11-20 03:37:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-20 03:37:45,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:45,858 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:45,858 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:45,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:45,858 INFO L82 PathProgramCache]: Analyzing trace with hash 573108616, now seen corresponding path program 1 times [2019-11-20 03:37:45,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:45,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143508279] [2019-11-20 03:37:45,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-11-20 03:37:46,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143508279] [2019-11-20 03:37:46,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:46,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:37:46,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3954777] [2019-11-20 03:37:46,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:37:46,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:46,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:37:46,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:37:46,230 INFO L87 Difference]: Start difference. First operand 2485 states and 3822 transitions. Second operand 5 states. [2019-11-20 03:37:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:47,079 INFO L93 Difference]: Finished difference Result 7356 states and 11346 transitions. [2019-11-20 03:37:47,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:37:47,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 419 [2019-11-20 03:37:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:47,101 INFO L225 Difference]: With dead ends: 7356 [2019-11-20 03:37:47,102 INFO L226 Difference]: Without dead ends: 4890 [2019-11-20 03:37:47,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 03:37:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2019-11-20 03:37:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4699. [2019-11-20 03:37:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4699 states. [2019-11-20 03:37:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 7295 transitions. [2019-11-20 03:37:47,234 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 7295 transitions. Word has length 419 [2019-11-20 03:37:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:47,234 INFO L462 AbstractCegarLoop]: Abstraction has 4699 states and 7295 transitions. [2019-11-20 03:37:47,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:37:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 7295 transitions. [2019-11-20 03:37:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-20 03:37:47,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:47,245 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:47,246 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1618435896, now seen corresponding path program 1 times [2019-11-20 03:37:47,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:47,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006639798] [2019-11-20 03:37:47,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 916 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-20 03:37:47,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006639798] [2019-11-20 03:37:47,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:47,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 03:37:47,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119497189] [2019-11-20 03:37:47,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:37:47,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:47,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:37:47,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:37:47,703 INFO L87 Difference]: Start difference. First operand 4699 states and 7295 transitions. Second operand 7 states. [2019-11-20 03:37:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:49,887 INFO L93 Difference]: Finished difference Result 16859 states and 25967 transitions. [2019-11-20 03:37:49,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:37:49,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 419 [2019-11-20 03:37:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:49,911 INFO L225 Difference]: With dead ends: 16859 [2019-11-20 03:37:49,911 INFO L226 Difference]: Without dead ends: 12179 [2019-11-20 03:37:49,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:37:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12179 states. [2019-11-20 03:37:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12179 to 6591. [2019-11-20 03:37:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-11-20 03:37:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 10642 transitions. [2019-11-20 03:37:50,124 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 10642 transitions. Word has length 419 [2019-11-20 03:37:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:50,125 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 10642 transitions. [2019-11-20 03:37:50,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:37:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 10642 transitions. [2019-11-20 03:37:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-20 03:37:50,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:50,140 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:50,140 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash -177425532, now seen corresponding path program 1 times [2019-11-20 03:37:50,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:50,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455663633] [2019-11-20 03:37:50,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 1008 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-11-20 03:37:50,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455663633] [2019-11-20 03:37:50,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:50,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:37:50,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034403466] [2019-11-20 03:37:50,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:37:50,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:50,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:37:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:37:50,535 INFO L87 Difference]: Start difference. First operand 6591 states and 10642 transitions. Second operand 4 states. [2019-11-20 03:37:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:51,053 INFO L93 Difference]: Finished difference Result 14299 states and 22747 transitions. [2019-11-20 03:37:51,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:37:51,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-20 03:37:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:51,071 INFO L225 Difference]: With dead ends: 14299 [2019-11-20 03:37:51,071 INFO L226 Difference]: Without dead ends: 7727 [2019-11-20 03:37:51,079 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 03:37:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2019-11-20 03:37:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 6609. [2019-11-20 03:37:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6609 states. [2019-11-20 03:37:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 10660 transitions. [2019-11-20 03:37:51,266 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 10660 transitions. Word has length 421 [2019-11-20 03:37:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:51,267 INFO L462 AbstractCegarLoop]: Abstraction has 6609 states and 10660 transitions. [2019-11-20 03:37:51,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:37:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 10660 transitions. [2019-11-20 03:37:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-20 03:37:51,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:51,282 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:51,283 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -572426730, now seen corresponding path program 1 times [2019-11-20 03:37:51,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:51,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031447781] [2019-11-20 03:37:51,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2019-11-20 03:37:51,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031447781] [2019-11-20 03:37:51,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:51,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 03:37:51,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834056058] [2019-11-20 03:37:51,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:37:51,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:51,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:37:51,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:37:51,680 INFO L87 Difference]: Start difference. First operand 6609 states and 10660 transitions. Second operand 7 states. [2019-11-20 03:37:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:53,281 INFO L93 Difference]: Finished difference Result 15579 states and 24311 transitions. [2019-11-20 03:37:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 03:37:53,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 421 [2019-11-20 03:37:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:53,293 INFO L225 Difference]: With dead ends: 15579 [2019-11-20 03:37:53,293 INFO L226 Difference]: Without dead ends: 8989 [2019-11-20 03:37:53,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:37:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2019-11-20 03:37:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 5149. [2019-11-20 03:37:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5149 states. [2019-11-20 03:37:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 8033 transitions. [2019-11-20 03:37:53,471 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 8033 transitions. Word has length 421 [2019-11-20 03:37:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:53,471 INFO L462 AbstractCegarLoop]: Abstraction has 5149 states and 8033 transitions. [2019-11-20 03:37:53,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:37:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 8033 transitions. [2019-11-20 03:37:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-11-20 03:37:53,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:53,482 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:53,482 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 695394340, now seen corresponding path program 1 times [2019-11-20 03:37:53,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:53,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277416048] [2019-11-20 03:37:53,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 1146 proven. 92 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-11-20 03:37:53,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277416048] [2019-11-20 03:37:53,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22024210] [2019-11-20 03:37:53,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:37:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:54,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:37:54,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:37:54,292 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 8 [2019-11-20 03:37:54,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:37:54,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:37:54,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:37:54,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 03:37:54,330 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 74 treesize of output 62 [2019-11-20 03:37:54,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 03:37:54,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:37:54,339 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 62 treesize of output 38 [2019-11-20 03:37:54,340 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 03:37:54,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:37:54,415 INFO L343 Elim1Store]: treesize reduction 59, result has 52.0 percent of original size [2019-11-20 03:37:54,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 73 [2019-11-20 03:37:54,416 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:37:54,461 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2019-11-20 03:37:54,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:37:54,465 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-11-20 03:37:54,514 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 03:37:54,515 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 28 treesize of output 10 [2019-11-20 03:37:54,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:37:54,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:37:54,517 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 03:37:54,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 03:37:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 1135 proven. 28 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-11-20 03:37:54,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:37:54,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-11-20 03:37:54,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138477379] [2019-11-20 03:37:54,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 03:37:54,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:54,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 03:37:54,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:37:54,920 INFO L87 Difference]: Start difference. First operand 5149 states and 8033 transitions. Second operand 11 states. [2019-11-20 03:37:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:37:57,869 INFO L93 Difference]: Finished difference Result 15397 states and 23938 transitions. [2019-11-20 03:37:57,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 03:37:57,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 445 [2019-11-20 03:37:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:37:57,888 INFO L225 Difference]: With dead ends: 15397 [2019-11-20 03:37:57,888 INFO L226 Difference]: Without dead ends: 10267 [2019-11-20 03:37:57,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:37:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2019-11-20 03:37:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 6769. [2019-11-20 03:37:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6769 states. [2019-11-20 03:37:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 11003 transitions. [2019-11-20 03:37:58,112 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 11003 transitions. Word has length 445 [2019-11-20 03:37:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:37:58,113 INFO L462 AbstractCegarLoop]: Abstraction has 6769 states and 11003 transitions. [2019-11-20 03:37:58,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 03:37:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 11003 transitions. [2019-11-20 03:37:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-11-20 03:37:58,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:37:58,139 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:37:58,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:37:58,343 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:37:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:37:58,344 INFO L82 PathProgramCache]: Analyzing trace with hash 60458544, now seen corresponding path program 1 times [2019-11-20 03:37:58,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:37:58,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106075272] [2019-11-20 03:37:58,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:37:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:37:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 980 proven. 0 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2019-11-20 03:37:58,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106075272] [2019-11-20 03:37:58,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:37:58,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 03:37:58,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327927377] [2019-11-20 03:37:58,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:37:58,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:37:58,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:37:58,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:37:58,854 INFO L87 Difference]: Start difference. First operand 6769 states and 11003 transitions. Second operand 7 states. [2019-11-20 03:38:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:01,003 INFO L93 Difference]: Finished difference Result 19094 states and 30009 transitions. [2019-11-20 03:38:01,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 03:38:01,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 449 [2019-11-20 03:38:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:01,079 INFO L225 Difference]: With dead ends: 19094 [2019-11-20 03:38:01,079 INFO L226 Difference]: Without dead ends: 12344 [2019-11-20 03:38:01,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-20 03:38:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12344 states. [2019-11-20 03:38:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12344 to 7759. [2019-11-20 03:38:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7759 states. [2019-11-20 03:38:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 12740 transitions. [2019-11-20 03:38:01,343 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 12740 transitions. Word has length 449 [2019-11-20 03:38:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:01,344 INFO L462 AbstractCegarLoop]: Abstraction has 7759 states and 12740 transitions. [2019-11-20 03:38:01,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:38:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 12740 transitions. [2019-11-20 03:38:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-11-20 03:38:01,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:01,358 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:01,358 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1618269714, now seen corresponding path program 1 times [2019-11-20 03:38:01,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:38:01,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586885565] [2019-11-20 03:38:01,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:38:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2019-11-20 03:38:01,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586885565] [2019-11-20 03:38:01,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:38:01,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:38:01,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001147454] [2019-11-20 03:38:01,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:38:01,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:38:01,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:38:01,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:38:01,610 INFO L87 Difference]: Start difference. First operand 7759 states and 12740 transitions. Second operand 4 states. [2019-11-20 03:38:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:02,317 INFO L93 Difference]: Finished difference Result 16327 states and 26536 transitions. [2019-11-20 03:38:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:38:02,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 451 [2019-11-20 03:38:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:02,326 INFO L225 Difference]: With dead ends: 16327 [2019-11-20 03:38:02,326 INFO L226 Difference]: Without dead ends: 8587 [2019-11-20 03:38:02,331 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 03:38:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2019-11-20 03:38:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 7759. [2019-11-20 03:38:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7759 states. [2019-11-20 03:38:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 12722 transitions. [2019-11-20 03:38:02,559 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 12722 transitions. Word has length 451 [2019-11-20 03:38:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:02,559 INFO L462 AbstractCegarLoop]: Abstraction has 7759 states and 12722 transitions. [2019-11-20 03:38:02,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:38:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 12722 transitions. [2019-11-20 03:38:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-11-20 03:38:02,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:02,574 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:02,575 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:02,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2020833512, now seen corresponding path program 1 times [2019-11-20 03:38:02,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:38:02,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052259485] [2019-11-20 03:38:02,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:38:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 967 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2019-11-20 03:38:02,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052259485] [2019-11-20 03:38:02,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:38:02,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:38:02,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065842880] [2019-11-20 03:38:02,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:38:02,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:38:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:38:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:38:02,936 INFO L87 Difference]: Start difference. First operand 7759 states and 12722 transitions. Second operand 5 states. [2019-11-20 03:38:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:03,557 INFO L93 Difference]: Finished difference Result 16738 states and 27115 transitions. [2019-11-20 03:38:03,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:38:03,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 451 [2019-11-20 03:38:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:03,565 INFO L225 Difference]: With dead ends: 16738 [2019-11-20 03:38:03,565 INFO L226 Difference]: Without dead ends: 8998 [2019-11-20 03:38:03,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 3 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 03:38:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2019-11-20 03:38:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 7759. [2019-11-20 03:38:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7759 states. [2019-11-20 03:38:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 12677 transitions. [2019-11-20 03:38:03,947 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 12677 transitions. Word has length 451 [2019-11-20 03:38:03,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:03,948 INFO L462 AbstractCegarLoop]: Abstraction has 7759 states and 12677 transitions. [2019-11-20 03:38:03,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:38:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 12677 transitions. [2019-11-20 03:38:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-20 03:38:03,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:03,956 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:03,956 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:03,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:03,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1383199474, now seen corresponding path program 1 times [2019-11-20 03:38:03,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:38:03,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605955853] [2019-11-20 03:38:03,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:38:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 838 proven. 156 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-11-20 03:38:04,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605955853] [2019-11-20 03:38:04,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401553404] [2019-11-20 03:38:04,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:38:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:04,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:38:04,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:38:04,669 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 8 [2019-11-20 03:38:04,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:04,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:04,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:38:04,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 03:38:04,695 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.offset_159|], 5=[|v_#memory_int_179|]} [2019-11-20 03:38:04,706 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 81 treesize of output 63 [2019-11-20 03:38:04,707 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 03:38:04,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:04,711 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 63 treesize of output 51 [2019-11-20 03:38:04,712 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 03:38:04,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:04,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:04,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-20 03:38:04,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:04,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:04,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:04,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:04,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:04,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:04,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:04,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:04,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:04,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:38:04,967 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 03:38:04,970 INFO L168 Benchmark]: Toolchain (without parser) took 41097.63 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 944.7 MB in the beginning and 1.6 GB in the end (delta: -633.2 MB). Peak memory consumption was 550.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:38:04,970 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 03:38:04,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:38:04,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:38:04,971 INFO L168 Benchmark]: Boogie Preprocessor took 118.84 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:38:04,971 INFO L168 Benchmark]: RCFGBuilder took 1334.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.3 MB in the end (delta: 95.9 MB). Peak memory consumption was 95.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:38:04,971 INFO L168 Benchmark]: TraceAbstraction took 38800.89 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 986.3 MB in the beginning and 1.6 GB in the end (delta: -591.6 MB). Peak memory consumption was 463.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:38:04,973 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 724.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 118.84 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1334.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.3 MB in the end (delta: 95.9 MB). Peak memory consumption was 95.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38800.89 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 986.3 MB in the beginning and 1.6 GB in the end (delta: -591.6 MB). Peak memory consumption was 463.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 03:38:06,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:38:06,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:38:06,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:38:06,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:38:06,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:38:06,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:38:06,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:38:06,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:38:06,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:38:06,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:38:06,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:38:06,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:38:06,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:38:06,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:38:06,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:38:06,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:38:06,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:38:06,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:38:06,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:38:06,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:38:06,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:38:06,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:38:06,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:38:06,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:38:06,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:38:06,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:38:06,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:38:06,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:38:06,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:38:06,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:38:06,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:38:06,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:38:06,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:38:06,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:38:06,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:38:06,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:38:06,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:38:06,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:38:06,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:38:06,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:38:06,837 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 03:38:06,865 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:38:06,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:38:06,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:38:06,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:38:06,868 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:38:06,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:38:06,869 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:38:06,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:38:06,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:38:06,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:38:06,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:38:06,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:38:06,871 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:38:06,871 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:38:06,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:38:06,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:38:06,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:38:06,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:38:06,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:38:06,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:38:06,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:38:06,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:38:06,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:38:06,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:38:06,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:38:06,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:38:06,874 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:38:06,874 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:38:06,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:38:06,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:38:06,875 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_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 -> a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 [2019-11-20 03:38:07,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:38:07,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:38:07,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:38:07,211 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:38:07,212 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:38:07,213 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-11-20 03:38:07,273 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data/6f0c8bd43/f0fee06c77a7451fb475acdf42ddfca9/FLAG96d203756 [2019-11-20 03:38:07,790 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:38:07,791 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-11-20 03:38:07,814 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data/6f0c8bd43/f0fee06c77a7451fb475acdf42ddfca9/FLAG96d203756 [2019-11-20 03:38:08,103 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/bin/uautomizer/data/6f0c8bd43/f0fee06c77a7451fb475acdf42ddfca9 [2019-11-20 03:38:08,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:38:08,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:38:08,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:38:08,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:38:08,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:38:08,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:08,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bbf7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08, skipping insertion in model container [2019-11-20 03:38:08,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:08,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:38:08,201 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:38:08,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:38:08,777 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:38:08,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:38:08,975 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:38:08,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08 WrapperNode [2019-11-20 03:38:08,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:38:08,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:38:08,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:38:08,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:38:08,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:38:09,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:38:09,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:38:09,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:38:09,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... [2019-11-20 03:38:09,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:38:09,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:38:09,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:38:09,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:38:09,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:38:09,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:38:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:38:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 03:38:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:38:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:38:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:38:09,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:38:09,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 03:38:09,482 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 03:38:11,832 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 03:38:11,833 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 03:38:11,834 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:38:11,834 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:38:11,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:38:11 BoogieIcfgContainer [2019-11-20 03:38:11,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:38:11,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:38:11,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:38:11,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:38:11,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:38:08" (1/3) ... [2019-11-20 03:38:11,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6236f683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:38:11, skipping insertion in model container [2019-11-20 03:38:11,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:38:08" (2/3) ... [2019-11-20 03:38:11,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6236f683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:38:11, skipping insertion in model container [2019-11-20 03:38:11,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:38:11" (3/3) ... [2019-11-20 03:38:11,846 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2019-11-20 03:38:11,855 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:38:11,862 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:38:11,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:38:11,897 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:38:11,898 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:38:11,898 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:38:11,898 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:38:11,899 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:38:11,899 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:38:11,899 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:38:11,899 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:38:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-11-20 03:38:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 03:38:11,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:11,938 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:11,939 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:11,945 INFO L82 PathProgramCache]: Analyzing trace with hash 62050801, now seen corresponding path program 1 times [2019-11-20 03:38:11,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:38:11,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [138356438] [2019-11-20 03:38:11,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:38:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:12,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:38:12,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:38:12,319 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 03:38:12,320 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:38:12,350 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 03:38:12,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [138356438] [2019-11-20 03:38:12,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:38:12,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 03:38:12,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880996197] [2019-11-20 03:38:12,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:38:12,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:38:12,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:38:12,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:38:12,375 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2019-11-20 03:38:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:12,594 INFO L93 Difference]: Finished difference Result 564 states and 965 transitions. [2019-11-20 03:38:12,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:38:12,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-20 03:38:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:12,611 INFO L225 Difference]: With dead ends: 564 [2019-11-20 03:38:12,611 INFO L226 Difference]: Without dead ends: 384 [2019-11-20 03:38:12,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 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 03:38:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-20 03:38:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-11-20 03:38:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-20 03:38:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2019-11-20 03:38:12,690 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 43 [2019-11-20 03:38:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:12,693 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2019-11-20 03:38:12,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:38:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2019-11-20 03:38:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 03:38:12,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:12,703 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:12,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:38:12,907 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:12,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1805197181, now seen corresponding path program 1 times [2019-11-20 03:38:12,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:38:12,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [480892947] [2019-11-20 03:38:12,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:38:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:13,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:38:13,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:38:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:38:13,188 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:38:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:38:13,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [480892947] [2019-11-20 03:38:13,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:38:13,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 03:38:13,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667597072] [2019-11-20 03:38:13,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:38:13,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:38:13,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:38:13,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:38:13,229 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand 4 states. [2019-11-20 03:38:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:13,584 INFO L93 Difference]: Finished difference Result 881 states and 1360 transitions. [2019-11-20 03:38:13,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:38:13,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-20 03:38:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:13,589 INFO L225 Difference]: With dead ends: 881 [2019-11-20 03:38:13,589 INFO L226 Difference]: Without dead ends: 630 [2019-11-20 03:38:13,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 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 03:38:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-11-20 03:38:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-11-20 03:38:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-11-20 03:38:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 958 transitions. [2019-11-20 03:38:13,653 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 958 transitions. Word has length 105 [2019-11-20 03:38:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:13,684 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 958 transitions. [2019-11-20 03:38:13,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:38:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 958 transitions. [2019-11-20 03:38:13,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 03:38:13,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:13,696 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, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:13,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:38:13,900 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash -928550483, now seen corresponding path program 1 times [2019-11-20 03:38:13,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:38:13,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1700887474] [2019-11-20 03:38:13,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:38:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:14,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:38:14,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:38:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 03:38:14,225 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:38:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 03:38:14,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1700887474] [2019-11-20 03:38:14,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:38:14,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 03:38:14,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694197214] [2019-11-20 03:38:14,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:38:14,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:38:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:38:14,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:38:14,260 INFO L87 Difference]: Start difference. First operand 630 states and 958 transitions. Second operand 3 states. [2019-11-20 03:38:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:14,583 INFO L93 Difference]: Finished difference Result 1249 states and 1909 transitions. [2019-11-20 03:38:14,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:38:14,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-20 03:38:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:14,589 INFO L225 Difference]: With dead ends: 1249 [2019-11-20 03:38:14,589 INFO L226 Difference]: Without dead ends: 752 [2019-11-20 03:38:14,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 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 03:38:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-20 03:38:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2019-11-20 03:38:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-11-20 03:38:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1140 transitions. [2019-11-20 03:38:14,626 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1140 transitions. Word has length 170 [2019-11-20 03:38:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:14,627 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1140 transitions. [2019-11-20 03:38:14,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:38:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1140 transitions. [2019-11-20 03:38:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 03:38:14,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:14,632 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, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 03:38:14,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:38:14,841 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1909543535, now seen corresponding path program 1 times [2019-11-20 03:38:14,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:38:14,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2133979951] [2019-11-20 03:38:14,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:38:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:15,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:38:15,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:38:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 03:38:15,195 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:38:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 03:38:15,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2133979951] [2019-11-20 03:38:15,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:38:15,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 03:38:15,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405845210] [2019-11-20 03:38:15,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:38:15,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:38:15,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:38:15,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:38:15,253 INFO L87 Difference]: Start difference. First operand 752 states and 1140 transitions. Second operand 4 states. [2019-11-20 03:38:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:15,917 INFO L93 Difference]: Finished difference Result 1616 states and 2465 transitions. [2019-11-20 03:38:15,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:38:15,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-20 03:38:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:15,925 INFO L225 Difference]: With dead ends: 1616 [2019-11-20 03:38:15,925 INFO L226 Difference]: Without dead ends: 997 [2019-11-20 03:38:15,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 418 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 03:38:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-20 03:38:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-20 03:38:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-20 03:38:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1510 transitions. [2019-11-20 03:38:15,975 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1510 transitions. Word has length 211 [2019-11-20 03:38:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:15,976 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1510 transitions. [2019-11-20 03:38:15,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:38:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1510 transitions. [2019-11-20 03:38:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-20 03:38:15,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:15,983 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:16,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:38:16,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1032540037, now seen corresponding path program 1 times [2019-11-20 03:38:16,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:38:16,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1605202656] [2019-11-20 03:38:16,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:38:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:16,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:38:16,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:38:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-20 03:38:16,666 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:38:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-20 03:38:16,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1605202656] [2019-11-20 03:38:16,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:38:16,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 03:38:16,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852054980] [2019-11-20 03:38:16,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:38:16,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:38:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:38:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:38:16,734 INFO L87 Difference]: Start difference. First operand 997 states and 1510 transitions. Second operand 3 states. [2019-11-20 03:38:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:17,107 INFO L93 Difference]: Finished difference Result 1982 states and 3011 transitions. [2019-11-20 03:38:17,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:38:17,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-20 03:38:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:17,115 INFO L225 Difference]: With dead ends: 1982 [2019-11-20 03:38:17,115 INFO L226 Difference]: Without dead ends: 1118 [2019-11-20 03:38:17,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 585 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 03:38:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-11-20 03:38:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2019-11-20 03:38:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-11-20 03:38:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1690 transitions. [2019-11-20 03:38:17,168 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1690 transitions. Word has length 294 [2019-11-20 03:38:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:17,168 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 1690 transitions. [2019-11-20 03:38:17,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:38:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1690 transitions. [2019-11-20 03:38:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-20 03:38:17,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:17,175 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:17,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:38:17,378 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1811855194, now seen corresponding path program 1 times [2019-11-20 03:38:17,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:38:17,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1817892522] [2019-11-20 03:38:17,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:38:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:17,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:38:17,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:38:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-20 03:38:17,964 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:38:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-20 03:38:18,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1817892522] [2019-11-20 03:38:18,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:38:18,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 03:38:18,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102840210] [2019-11-20 03:38:18,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:38:18,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:38:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:38:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:38:18,051 INFO L87 Difference]: Start difference. First operand 1118 states and 1690 transitions. Second operand 4 states. [2019-11-20 03:38:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:38:18,479 INFO L93 Difference]: Finished difference Result 2348 states and 3564 transitions. [2019-11-20 03:38:18,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:38:18,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-11-20 03:38:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:38:18,488 INFO L225 Difference]: With dead ends: 2348 [2019-11-20 03:38:18,488 INFO L226 Difference]: Without dead ends: 1363 [2019-11-20 03:38:18,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 662 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 03:38:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-20 03:38:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2019-11-20 03:38:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-20 03:38:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2058 transitions. [2019-11-20 03:38:18,544 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2058 transitions. Word has length 333 [2019-11-20 03:38:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:38:18,545 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2058 transitions. [2019-11-20 03:38:18,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:38:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2058 transitions. [2019-11-20 03:38:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-20 03:38:18,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:38:18,555 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:38:18,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:38:18,758 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:38:18,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:38:18,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1696282884, now seen corresponding path program 1 times [2019-11-20 03:38:18,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:38:18,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [639587939] [2019-11-20 03:38:18,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:38:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:38:22,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 03:38:22,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:38:23,306 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:23,306 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 03:38:23,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:23,607 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 03:38:23,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:23,610 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 03:38:23,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:23,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:23,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:23,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:23,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:23,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:23,792 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 03:38:23,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:23,931 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 03:38:23,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:23,937 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:23,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,008 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 03:38:24,009 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,061 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 03:38:24,061 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 03:38:24,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,119 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 03:38:24,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 03:38:24,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,181 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 03:38:24,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 03:38:24,206 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_198|], 12=[|v_#memory_$Pointer$.base_203|]} [2019-11-20 03:38:24,209 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 03:38:24,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,302 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,302 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 03:38:24,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 03:38:24,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,356 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 03:38:24,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 03:38:24,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,402 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 03:38:24,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:38:24,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 03:38:24,434 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_196|], 20=[|v_#memory_$Pointer$.base_206|]} [2019-11-20 03:38:24,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,445 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 03:38:24,445 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 03:38:24,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:24,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:24,981 WARN L191 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 03:38:24,981 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 03:38:24,982 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 03:38:24,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:24,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:24,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:24,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:24,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:24,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:25,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:38:25,092 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-20 03:38:25,514 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 37 [2019-11-20 03:38:25,515 INFO L567 ElimStorePlain]: treesize reduction 5807, result has 1.4 percent of original size [2019-11-20 03:38:25,515 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 03:38:25,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-20 03:38:25,585 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_199|], 30=[|v_#memory_$Pointer$.base_207|]} [2019-11-20 03:38:25,591 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 03:38:25,708 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 03:38:25,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:25,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:25,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:58,709 WARN L191 SmtUtils]: Spent 32.99 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 03:38:58,709 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 03:38:58,710 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 03:38:58,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:58,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:58,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:58,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:58,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:58,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:58,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:38:58,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:59,021 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 40 [2019-11-20 03:38:59,021 INFO L567 ElimStorePlain]: treesize reduction 10571, result has 0.9 percent of original size [2019-11-20 03:38:59,022 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 03:38:59,022 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 03:38:59,077 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_216|], 30=[|v_#memory_$Pointer$.base_208|]} [2019-11-20 03:38:59,098 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 03:38:59,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:38:59,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:38:59,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:59,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:59,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:59,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:59,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:38:59,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:39:15,554 WARN L191 SmtUtils]: Spent 16.38 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 03:39:15,555 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:15,555 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 03:39:15,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:15,564 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:39:15,828 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2019-11-20 03:39:15,828 INFO L567 ElimStorePlain]: treesize reduction 2622, result has 3.4 percent of original size [2019-11-20 03:39:15,829 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 03:39:15,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 03:39:15,916 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_197|], 2=[|v_#memory_int_217|], 20=[|v_#memory_$Pointer$.base_209|]} [2019-11-20 03:39:15,933 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 03:39:15,934 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 03:39:16,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:16,024 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 03:39:16,025 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:39:16,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:16,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:39:16,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:39:16,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:39:16,189 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 03:39:16,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:16,190 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 03:39:16,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:16,307 INFO L496 ElimStorePlain]: Start of recursive call 4: 130 dim-0 vars, End of recursive call: 130 dim-0 vars, and 21 xjuncts. [2019-11-20 03:39:48,466 WARN L191 SmtUtils]: Spent 32.16 s on a formula simplification. DAG size of input: 994 DAG size of output: 955 [2019-11-20 03:39:48,467 INFO L567 ElimStorePlain]: treesize reduction 208, result has 92.6 percent of original size [2019-11-20 03:39:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 03:39:48,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 03:39:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 03:39:48,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-11-20 03:39:48,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 03:39:48,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 03:39:48,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 03:39:48,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:39:48,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:39:48,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 234 dim-0 vars, and 1 xjuncts. [2019-11-20 03:39:48,536 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:1660 [2019-11-20 03:39:49,676 WARN L191 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 1190 DAG size of output: 24 [2019-11-20 03:39:49,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:39:49,682 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 03:39:49,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:39:49,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:49,698 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 03:39:49,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-20 03:39:49,759 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 03:39:49,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:39:49,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:49,765 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 03:39:49,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 03:39:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 884 proven. 96 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-20 03:39:50,543 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:39:50,615 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 03:39:50,616 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 03:39:50,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:50,626 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 03:39:50,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 03:39:50,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:39:50,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:50,735 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 03:39:50,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:50,751 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 03:39:50,752 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2019-11-20 03:39:50,804 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_227|], 2=[|v_#memory_$Pointer$.base_199|]} [2019-11-20 03:39:50,807 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 03:39:50,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:50,835 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 03:39:50,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:50,839 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 03:39:50,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-11-20 03:39:50,874 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 03:39:50,874 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 03:39:50,874 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 03:39:50,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:50,883 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 03:39:50,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-11-20 03:39:50,965 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 03:39:50,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:50,976 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 03:39:50,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 03:39:51,272 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 03:39:51,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:51,290 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 03:39:51,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 03:39:51,522 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_198|], 20=[|v_#memory_$Pointer$.base_231|]} [2019-11-20 03:39:51,526 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 03:39:51,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:51,559 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 03:39:51,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:51,572 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 03:39:51,572 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2019-11-20 03:39:51,941 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 03:39:51,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:51,958 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 03:39:51,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 03:39:52,096 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 03:39:52,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:39:52,106 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 03:39:52,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 03:39:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 820 proven. 160 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-20 03:39:53,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639587939] [2019-11-20 03:39:53,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:39:53,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 03:39:53,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977670568] [2019-11-20 03:39:53,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 03:39:53,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:39:53,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 03:39:53,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 03:39:53,622 INFO L87 Difference]: Start difference. First operand 1363 states and 2058 transitions. Second operand 13 states. [2019-11-20 03:41:20,573 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-20 03:42:29,116 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 03:44:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:44:09,446 INFO L93 Difference]: Finished difference Result 9936 states and 15072 transitions. [2019-11-20 03:44:09,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 03:44:09,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 419 [2019-11-20 03:44:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:44:09,491 INFO L225 Difference]: With dead ends: 9936 [2019-11-20 03:44:09,491 INFO L226 Difference]: Without dead ends: 8581 [2019-11-20 03:44:09,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 818 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=122, Invalid=291, Unknown=7, NotChecked=0, Total=420 [2019-11-20 03:44:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8581 states. [2019-11-20 03:44:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8581 to 3462. [2019-11-20 03:44:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2019-11-20 03:44:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 5543 transitions. [2019-11-20 03:44:09,680 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 5543 transitions. Word has length 419 [2019-11-20 03:44:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:44:09,680 INFO L462 AbstractCegarLoop]: Abstraction has 3462 states and 5543 transitions. [2019-11-20 03:44:09,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 03:44:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 5543 transitions. [2019-11-20 03:44:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-11-20 03:44:09,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:44:09,695 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:44:09,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:44:09,918 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:44:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:44:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 351302342, now seen corresponding path program 1 times [2019-11-20 03:44:09,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:44:09,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [870453217] [2019-11-20 03:44:09,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:44:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:44:13,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 03:44:13,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:44:13,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:13,751 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 03:44:13,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:14,298 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 03:44:14,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:14,300 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_239|], 2=[|v_#memory_$Pointer$.base_236|, |v_#memory_$Pointer$.base_235|]} [2019-11-20 03:44:14,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,512 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 03:44:14,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:14,701 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 03:44:14,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:14,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,735 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 03:44:14,736 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:14,841 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 03:44:14,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:14,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,859 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 03:44:14,860 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:14,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:14,892 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 03:44:14,893 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 03:44:14,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,921 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:14,921 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 03:44:14,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:14,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:14,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:44:14,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 03:44:14,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:14,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:14,949 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 03:44:14,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:14,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:14,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:44:14,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 03:44:14,970 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_237|], 12=[|v_#memory_$Pointer$.base_242|]} [2019-11-20 03:44:14,973 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 03:44:15,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:15,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:15,041 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 03:44:15,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:15,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:15,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:44:15,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 03:44:15,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,076 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:15,077 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 03:44:15,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:15,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:15,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:44:15,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 03:44:15,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:15,101 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 03:44:15,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:44:15,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:15,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:44:15,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 03:44:15,130 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_223|], 20=[|v_#memory_$Pointer$.base_245|]} [2019-11-20 03:44:15,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,141 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 03:44:15,141 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 03:44:15,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:44:15,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:44:15,709 WARN L191 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 03:44:15,710 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 03:44:15,710 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 03:44:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:15,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:15,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:44:16,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:44:16,473 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 03:45:11,290 WARN L191 SmtUtils]: Spent 54.82 s on a formula simplification. DAG size of input: 1476 DAG size of output: 850 [2019-11-20 03:45:11,291 INFO L567 ElimStorePlain]: treesize reduction 8189, result has 42.7 percent of original size [2019-11-20 03:45:11,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 03:45:11,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 03:45:11,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 03:45:11,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 03:45:11,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:11,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,429 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 03:45:11,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:6839 [2019-11-20 03:45:11,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:11,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:12,767 WARN L191 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 1030 DAG size of output: 44 [2019-11-20 03:45:12,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:12,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:12,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:12,799 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_238|], 30=[|v_#memory_$Pointer$.base_246|]} [2019-11-20 03:45:12,807 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 03:45:12,918 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 03:45:12,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:45:12,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:12,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:45,927 WARN L191 SmtUtils]: Spent 32.99 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 03:45:45,927 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 03:45:45,927 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 03:45:45,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:45,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:45,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:45,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:45,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:45,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:45,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:45:45,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:45:46,457 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 40 [2019-11-20 03:45:46,457 INFO L567 ElimStorePlain]: treesize reduction 14991, result has 0.6 percent of original size [2019-11-20 03:45:46,458 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 03:45:46,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 03:45:46,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:46,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:45:47,458 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_244|], 30=[|v_#memory_$Pointer$.base_247|]} [2019-11-20 03:45:47,475 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 03:45:47,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:45:47,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:45:47,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:47,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:47,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:47,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:47,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:45:47,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:46:03,918 WARN L191 SmtUtils]: Spent 16.37 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 03:46:03,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:03,918 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 03:46:03,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:46:03,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:03,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:03,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:03,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:04,310 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2019-11-20 03:46:04,310 INFO L567 ElimStorePlain]: treesize reduction 6705, result has 1.4 percent of original size [2019-11-20 03:46:04,310 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 03:46:04,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 03:46:04,366 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_224|], 2=[|v_#memory_int_245|], 20=[|v_#memory_$Pointer$.base_248|]} [2019-11-20 03:46:04,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 31 treesize of output 25 [2019-11-20 03:46:04,392 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 03:46:04,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:04,453 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 03:46:04,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:04,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:04,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:46:04,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:46:04,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:46:04,633 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 03:46:04,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:04,634 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 03:46:04,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:04,672 INFO L496 ElimStorePlain]: Start of recursive call 4: 111 dim-0 vars, End of recursive call: 111 dim-0 vars, and 12 xjuncts. [2019-11-20 03:46:19,185 WARN L191 SmtUtils]: Spent 14.51 s on a formula simplification that was a NOOP. DAG size: 894 [2019-11-20 03:46:19,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:19,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 03:46:19,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:46:19,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 03:46:19,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 03:46:19,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:46:19,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:46:19,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:46:19,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:46:19,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 03:46:19,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 03:46:19,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 03:46:19,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:46:19,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 03:46:19,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:46:19,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:46:19,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 222 dim-0 vars, and 1 xjuncts. [2019-11-20 03:46:19,235 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:1568 [2019-11-20 03:46:20,631 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 1125 DAG size of output: 24 [2019-11-20 03:46:20,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:46:20,636 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 03:46:20,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:20,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:20,652 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 03:46:20,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:37 [2019-11-20 03:46:20,701 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 33 treesize of output 15 [2019-11-20 03:46:20,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:20,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:20,707 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 03:46:20,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:3 [2019-11-20 03:46:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 894 proven. 98 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-11-20 03:46:21,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:46:21,410 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 03:46:21,411 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 03:46:21,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:21,416 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 03:46:21,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 03:46:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1586 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2019-11-20 03:46:21,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [870453217] [2019-11-20 03:46:21,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:46:21,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-20 03:46:21,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652225326] [2019-11-20 03:46:21,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:46:21,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:46:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:46:21,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:46:21,569 INFO L87 Difference]: Start difference. First operand 3462 states and 5543 transitions. Second operand 4 states. [2019-11-20 03:46:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:46:24,715 INFO L93 Difference]: Finished difference Result 9317 states and 14788 transitions. [2019-11-20 03:46:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:46:24,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-11-20 03:46:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:46:24,738 INFO L225 Difference]: With dead ends: 9317 [2019-11-20 03:46:24,738 INFO L226 Difference]: Without dead ends: 5863 [2019-11-20 03:46:24,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 788 SyntacticMatches, 46 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:46:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5863 states. [2019-11-20 03:46:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5863 to 4342. [2019-11-20 03:46:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4342 states. [2019-11-20 03:46:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4342 states to 4342 states and 7171 transitions. [2019-11-20 03:46:24,927 INFO L78 Accepts]: Start accepts. Automaton has 4342 states and 7171 transitions. Word has length 422 [2019-11-20 03:46:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:46:24,927 INFO L462 AbstractCegarLoop]: Abstraction has 4342 states and 7171 transitions. [2019-11-20 03:46:24,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:46:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4342 states and 7171 transitions. [2019-11-20 03:46:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 03:46:24,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:46:24,938 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:46:25,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:46:25,160 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:46:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:46:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1955947293, now seen corresponding path program 1 times [2019-11-20 03:46:25,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:46:25,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1291753240] [2019-11-20 03:46:25,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:46:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:46:26,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:46:26,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:46:26,041 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_242|, |v_#memory_$Pointer$.base_266|], 4=[|v_#memory_int_264|]} [2019-11-20 03:46:26,045 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 03:46:26,045 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 03:46:26,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:26,069 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 03:46:26,069 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 03:46:26,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:26,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:26,149 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 03:46:26,149 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:34,289 WARN L191 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 03:46:34,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:34,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:46:34,290 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 03:46:34,302 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 03:46:34,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:34,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:34,304 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 03:46:34,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 03:46:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1628 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2019-11-20 03:46:34,445 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:46:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1628 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2019-11-20 03:46:34,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1291753240] [2019-11-20 03:46:34,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:46:34,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:46:34,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398620801] [2019-11-20 03:46:34,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:46:34,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:46:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:46:34,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:46:34,574 INFO L87 Difference]: Start difference. First operand 4342 states and 7171 transitions. Second operand 6 states. [2019-11-20 03:46:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:46:41,537 INFO L93 Difference]: Finished difference Result 11346 states and 18242 transitions. [2019-11-20 03:46:41,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:46:41,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 433 [2019-11-20 03:46:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:46:41,567 INFO L225 Difference]: With dead ends: 11346 [2019-11-20 03:46:41,567 INFO L226 Difference]: Without dead ends: 7406 [2019-11-20 03:46:41,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 860 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 03:46:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7406 states. [2019-11-20 03:46:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7406 to 4562. [2019-11-20 03:46:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4562 states. [2019-11-20 03:46:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4562 states to 4562 states and 7510 transitions. [2019-11-20 03:46:41,771 INFO L78 Accepts]: Start accepts. Automaton has 4562 states and 7510 transitions. Word has length 433 [2019-11-20 03:46:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:46:41,771 INFO L462 AbstractCegarLoop]: Abstraction has 4562 states and 7510 transitions. [2019-11-20 03:46:41,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:46:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4562 states and 7510 transitions. [2019-11-20 03:46:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 03:46:41,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:46:41,782 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:46:41,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:46:41,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:46:41,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:46:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1442195589, now seen corresponding path program 2 times [2019-11-20 03:46:41,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:46:41,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1150312685] [2019-11-20 03:46:41,993 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:46:43,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:46:43,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:46:43,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:46:43,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:46:43,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:46:43,248 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 03:46:43,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:43,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:43,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:46:43,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 03:46:43,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:43,278 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 03:46:43,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:43,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:43,280 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 03:46:43,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 03:46:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1628 backedges. 172 proven. 1 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2019-11-20 03:46:43,395 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:46:43,427 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 03:46:43,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:43,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:43,429 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:46:43,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:43,430 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 03:46:43,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 03:46:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1628 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2019-11-20 03:46:43,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1150312685] [2019-11-20 03:46:43,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:46:43,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 03:46:43,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464904566] [2019-11-20 03:46:43,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:46:43,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:46:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:46:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:46:43,540 INFO L87 Difference]: Start difference. First operand 4562 states and 7510 transitions. Second operand 4 states. [2019-11-20 03:46:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:46:46,286 INFO L93 Difference]: Finished difference Result 8514 states and 13565 transitions. [2019-11-20 03:46:46,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:46:46,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-20 03:46:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:46:46,298 INFO L225 Difference]: With dead ends: 8514 [2019-11-20 03:46:46,298 INFO L226 Difference]: Without dead ends: 6072 [2019-11-20 03:46:46,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 859 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 03:46:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2019-11-20 03:46:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 4562. [2019-11-20 03:46:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4562 states. [2019-11-20 03:46:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4562 states to 4562 states and 7454 transitions. [2019-11-20 03:46:46,461 INFO L78 Accepts]: Start accepts. Automaton has 4562 states and 7454 transitions. Word has length 433 [2019-11-20 03:46:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:46:46,461 INFO L462 AbstractCegarLoop]: Abstraction has 4562 states and 7454 transitions. [2019-11-20 03:46:46,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:46:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4562 states and 7454 transitions. [2019-11-20 03:46:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 03:46:46,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:46:46,472 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:46:46,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:46:46,681 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:46:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:46:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash -628738313, now seen corresponding path program 1 times [2019-11-20 03:46:46,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:46:46,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1836953432] [2019-11-20 03:46:46,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:46:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:46:47,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:46:47,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:46:47,605 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_318|, |v_#memory_$Pointer$.offset_294|], 4=[|v_#memory_int_317|]} [2019-11-20 03:46:47,607 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 03:46:47,607 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 03:46:47,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:47,629 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 03:46:47,629 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 03:46:47,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:47,730 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:47,730 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 03:46:47,730 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:55,879 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 03:46:55,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:55,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:46:55,880 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 03:46:55,887 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 03:46:55,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:46:55,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:46:55,889 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 03:46:55,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 03:46:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 822 proven. 0 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2019-11-20 03:46:55,990 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:46:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 822 proven. 0 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2019-11-20 03:46:56,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836953432] [2019-11-20 03:46:56,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:46:56,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:46:56,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785153632] [2019-11-20 03:46:56,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:46:56,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:46:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:46:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:46:56,169 INFO L87 Difference]: Start difference. First operand 4562 states and 7454 transitions. Second operand 6 states. [2019-11-20 03:47:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:03,655 INFO L93 Difference]: Finished difference Result 12315 states and 19663 transitions. [2019-11-20 03:47:03,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:47:03,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 433 [2019-11-20 03:47:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:03,671 INFO L225 Difference]: With dead ends: 12315 [2019-11-20 03:47:03,671 INFO L226 Difference]: Without dead ends: 7772 [2019-11-20 03:47:03,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 860 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 03:47:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7772 states. [2019-11-20 03:47:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7772 to 5268. [2019-11-20 03:47:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5268 states. [2019-11-20 03:47:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 8700 transitions. [2019-11-20 03:47:03,877 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 8700 transitions. Word has length 433 [2019-11-20 03:47:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:03,878 INFO L462 AbstractCegarLoop]: Abstraction has 5268 states and 8700 transitions. [2019-11-20 03:47:03,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:47:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 8700 transitions. [2019-11-20 03:47:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-20 03:47:03,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:03,887 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:04,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:47:04,089 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1897708785, now seen corresponding path program 2 times [2019-11-20 03:47:04,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:47:04,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [285936616] [2019-11-20 03:47:04,091 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:47:05,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:47:05,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:47:05,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:47:05,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:05,377 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 03:47:05,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:05,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:05,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:47:05,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 03:47:05,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:47:05,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 03:47:05,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:05,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:05,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:47:05,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 03:47:05,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:05,457 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 03:47:05,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:05,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:05,459 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 03:47:05,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 03:47:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 324 proven. 2 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2019-11-20 03:47:05,577 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:47:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2019-11-20 03:47:05,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [285936616] [2019-11-20 03:47:05,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:47:05,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-20 03:47:05,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343056747] [2019-11-20 03:47:05,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:47:05,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:47:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:47:05,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:47:05,684 INFO L87 Difference]: Start difference. First operand 5268 states and 8700 transitions. Second operand 4 states. [2019-11-20 03:47:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:08,257 INFO L93 Difference]: Finished difference Result 9555 states and 15309 transitions. [2019-11-20 03:47:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:47:08,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-20 03:47:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:08,270 INFO L225 Difference]: With dead ends: 9555 [2019-11-20 03:47:08,270 INFO L226 Difference]: Without dead ends: 6760 [2019-11-20 03:47:08,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:47:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6760 states. [2019-11-20 03:47:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6760 to 5268. [2019-11-20 03:47:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5268 states. [2019-11-20 03:47:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 8628 transitions. [2019-11-20 03:47:08,492 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 8628 transitions. Word has length 433 [2019-11-20 03:47:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:08,492 INFO L462 AbstractCegarLoop]: Abstraction has 5268 states and 8628 transitions. [2019-11-20 03:47:08,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:47:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 8628 transitions. [2019-11-20 03:47:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-20 03:47:08,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:08,501 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:08,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:47:08,710 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash 7816276, now seen corresponding path program 1 times [2019-11-20 03:47:08,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:47:08,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [53732829] [2019-11-20 03:47:08,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:47:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:09,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:47:09,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:09,735 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_338|, |v_#memory_$Pointer$.base_362|], 4=[|v_#memory_int_363|]} [2019-11-20 03:47:09,738 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 03:47:09,738 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 03:47:09,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:09,751 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 03:47:09,752 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 03:47:09,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:09,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:09,804 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 03:47:09,805 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:17,975 WARN L191 SmtUtils]: Spent 8.17 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 03:47:17,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:17,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:47:17,976 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 03:47:17,983 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 03:47:17,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:17,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:17,985 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 03:47:17,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 03:47:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2019-11-20 03:47:18,158 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:47:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2019-11-20 03:47:18,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [53732829] [2019-11-20 03:47:18,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:47:18,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:47:18,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146806631] [2019-11-20 03:47:18,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:47:18,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:47:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:47:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:47:18,309 INFO L87 Difference]: Start difference. First operand 5268 states and 8628 transitions. Second operand 6 states. [2019-11-20 03:47:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:24,099 INFO L93 Difference]: Finished difference Result 13929 states and 22318 transitions. [2019-11-20 03:47:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:47:24,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 434 [2019-11-20 03:47:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:24,109 INFO L225 Difference]: With dead ends: 13929 [2019-11-20 03:47:24,110 INFO L226 Difference]: Without dead ends: 8680 [2019-11-20 03:47:24,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 862 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 03:47:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2019-11-20 03:47:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 5708. [2019-11-20 03:47:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2019-11-20 03:47:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 9288 transitions. [2019-11-20 03:47:24,354 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 9288 transitions. Word has length 434 [2019-11-20 03:47:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:24,354 INFO L462 AbstractCegarLoop]: Abstraction has 5708 states and 9288 transitions. [2019-11-20 03:47:24,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:47:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 9288 transitions. [2019-11-20 03:47:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-20 03:47:24,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:24,362 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:24,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:47:24,565 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:24,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:24,565 INFO L82 PathProgramCache]: Analyzing trace with hash 765312678, now seen corresponding path program 2 times [2019-11-20 03:47:24,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:47:24,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2110996911] [2019-11-20 03:47:24,566 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:47:25,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:47:25,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:47:25,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:47:25,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:25,858 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 03:47:25,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:25,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:25,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:47:25,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 03:47:25,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:47:25,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 03:47:25,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:25,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:25,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:47:25,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 03:47:25,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:25,904 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 03:47:25,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:25,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:25,906 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 03:47:25,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 03:47:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 335 proven. 2 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2019-11-20 03:47:26,037 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:47:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2019-11-20 03:47:26,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2110996911] [2019-11-20 03:47:26,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:47:26,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-20 03:47:26,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199361329] [2019-11-20 03:47:26,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:47:26,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:47:26,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:47:26,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:47:26,144 INFO L87 Difference]: Start difference. First operand 5708 states and 9288 transitions. Second operand 4 states. [2019-11-20 03:47:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:28,689 INFO L93 Difference]: Finished difference Result 10215 states and 16186 transitions. [2019-11-20 03:47:28,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:47:28,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-11-20 03:47:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:28,697 INFO L225 Difference]: With dead ends: 10215 [2019-11-20 03:47:28,697 INFO L226 Difference]: Without dead ends: 7200 [2019-11-20 03:47:28,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 859 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:47:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7200 states. [2019-11-20 03:47:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7200 to 5708. [2019-11-20 03:47:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2019-11-20 03:47:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 9196 transitions. [2019-11-20 03:47:28,942 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 9196 transitions. Word has length 434 [2019-11-20 03:47:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:28,943 INFO L462 AbstractCegarLoop]: Abstraction has 5708 states and 9196 transitions. [2019-11-20 03:47:28,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:47:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 9196 transitions. [2019-11-20 03:47:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-11-20 03:47:28,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:28,952 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:29,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:47:29,169 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1049080084, now seen corresponding path program 1 times [2019-11-20 03:47:29,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:47:29,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [361242370] [2019-11-20 03:47:29,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:47:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:30,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:47:30,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:30,057 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_410|, |v_#memory_$Pointer$.offset_386|], 4=[|v_#memory_int_413|]} [2019-11-20 03:47:30,058 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 03:47:30,058 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 03:47:30,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:30,069 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 03:47:30,069 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 03:47:30,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:30,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:30,143 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 03:47:30,144 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:38,296 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 03:47:38,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:38,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:47:38,297 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 03:47:38,305 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 03:47:38,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:38,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:38,307 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 03:47:38,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 03:47:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked. [2019-11-20 03:47:38,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:47:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked. [2019-11-20 03:47:38,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [361242370] [2019-11-20 03:47:38,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:47:38,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:47:38,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257246758] [2019-11-20 03:47:38,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:47:38,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:47:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:47:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:47:38,569 INFO L87 Difference]: Start difference. First operand 5708 states and 9196 transitions. Second operand 6 states. [2019-11-20 03:47:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:44,504 INFO L93 Difference]: Finished difference Result 14931 states and 23575 transitions. [2019-11-20 03:47:44,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:47:44,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 435 [2019-11-20 03:47:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:44,514 INFO L225 Difference]: With dead ends: 14931 [2019-11-20 03:47:44,514 INFO L226 Difference]: Without dead ends: 9242 [2019-11-20 03:47:44,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 870 GetRequests, 864 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 03:47:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9242 states. [2019-11-20 03:47:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9242 to 6662. [2019-11-20 03:47:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6662 states. [2019-11-20 03:47:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 10766 transitions. [2019-11-20 03:47:44,805 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 10766 transitions. Word has length 435 [2019-11-20 03:47:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:44,805 INFO L462 AbstractCegarLoop]: Abstraction has 6662 states and 10766 transitions. [2019-11-20 03:47:44,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:47:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 10766 transitions. [2019-11-20 03:47:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-11-20 03:47:44,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:44,817 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:45,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:47:45,024 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:45,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1912950834, now seen corresponding path program 1 times [2019-11-20 03:47:45,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:47:45,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [578180232] [2019-11-20 03:47:45,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:47:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:45,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:47:45,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:45,917 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_407|, |v_#memory_$Pointer$.base_431|], 4=[|v_#memory_int_434|]} [2019-11-20 03:47:45,918 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 03:47:45,919 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 03:47:45,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:45,928 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 03:47:45,928 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 03:47:45,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:46,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:46,005 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 03:47:46,005 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:54,117 WARN L191 SmtUtils]: Spent 8.11 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 03:47:54,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:54,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:47:54,118 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 03:47:54,124 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 03:47:54,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:47:54,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:47:54,126 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 03:47:54,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 03:47:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2019-11-20 03:47:54,246 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:47:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2019-11-20 03:47:54,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [578180232] [2019-11-20 03:47:54,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:47:54,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 03:47:54,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477643966] [2019-11-20 03:47:54,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:47:54,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:47:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:47:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:47:54,403 INFO L87 Difference]: Start difference. First operand 6662 states and 10766 transitions. Second operand 6 states. [2019-11-20 03:48:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:02,253 INFO L93 Difference]: Finished difference Result 15518 states and 24558 transitions. [2019-11-20 03:48:02,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:48:02,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 436 [2019-11-20 03:48:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:02,261 INFO L225 Difference]: With dead ends: 15518 [2019-11-20 03:48:02,261 INFO L226 Difference]: Without dead ends: 9462 [2019-11-20 03:48:02,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 866 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 03:48:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9462 states. [2019-11-20 03:48:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9462 to 6673. [2019-11-20 03:48:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6673 states. [2019-11-20 03:48:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 10686 transitions. [2019-11-20 03:48:02,461 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 10686 transitions. Word has length 436 [2019-11-20 03:48:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:02,461 INFO L462 AbstractCegarLoop]: Abstraction has 6673 states and 10686 transitions. [2019-11-20 03:48:02,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:48:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 10686 transitions. [2019-11-20 03:48:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-11-20 03:48:02,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:02,469 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:48:02,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:48:02,671 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2111419724, now seen corresponding path program 1 times [2019-11-20 03:48:02,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:48:02,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [368282030] [2019-11-20 03:48:02,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87a2cb5f-00d1-4b08-9e16-f0c2927ee5a3/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 03:48:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:05,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 03:48:05,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:48:05,044 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 03:48:05,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:48:05,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:48:05,063 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 19 treesize of output 1 [2019-11-20 03:48:05,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:48:05,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:48:05,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:48:05,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:22 [2019-11-20 03:48:05,085 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_432|], 2=[|v_#memory_$Pointer$.base_457|], 6=[|v_#memory_int_460|]} [2019-11-20 03:48:05,097 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 81 treesize of output 63 [2019-11-20 03:48:05,098 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 03:48:05,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:48:05,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:48:05,198 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 81 [2019-11-20 03:48:05,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,199 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-20 03:48:05,390 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-11-20 03:48:05,390 INFO L567 ElimStorePlain]: treesize reduction 129, result has 35.2 percent of original size [2019-11-20 03:48:05,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:48:05,552 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 03:48:05,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:48:05,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 227 [2019-11-20 03:48:05,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:48:05,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:48:05,965 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_852, v_prenex_721, v_prenex_688, v_prenex_699, v_prenex_865, v_prenex_682, v_prenex_890, v_prenex_709, v_prenex_804, v_prenex_707, v_prenex_828, v_prenex_800, v_prenex_723, v_prenex_801, v_prenex_735, v_prenex_845, v_prenex_825, v_prenex_737, v_prenex_847], 2=[v_prenex_840, v_prenex_884, v_prenex_686, v_prenex_841, v_prenex_764, v_prenex_886, v_prenex_843, v_prenex_880, v_prenex_760, v_prenex_882, v_prenex_684, v_prenex_762, v_prenex_685, v_arrayElimArr_2, v_prenex_837, v_prenex_838, v_prenex_719, v_prenex_712, v_prenex_713, v_prenex_834, v_prenex_714, v_prenex_835, v_prenex_715, v_prenex_753, v_prenex_797, v_prenex_831, v_prenex_875, v_prenex_677, v_prenex_711, v_prenex_755, v_prenex_870, v_prenex_793, v_prenex_872, v_prenex_751, v_prenex_791, v_prenex_705, v_prenex_826, v_prenex_745, v_prenex_789, v_prenex_702, v_prenex_867, v_prenex_824, v_prenex_747, v_prenex_868, v_prenex_741, v_prenex_862, v_prenex_785, v_prenex_742, v_prenex_820, v_prenex_864, v_prenex_787, v_prenex_700, v_prenex_821, v_prenex_744, v_prenex_860, v_prenex_740, v_prenex_819, v_prenex_815, v_prenex_859, v_prenex_739, v_prenex_817, v_prenex_818, v_prenex_855, v_prenex_730, v_prenex_697, v_prenex_698, v_prenex_733, v_prenex_854, v_prenex_693, v_prenex_850, v_prenex_773, v_prenex_690, v_prenex_691, v_prenex_808, v_prenex_727, v_prenex_848, v_prenex_849, v_prenex_806, v_prenex_729, v_prenex_807, v_prenex_888, v_prenex_889, v_prenex_725, v_prenex_769, v_prenex_726], 4=[v_prenex_720, v_prenex_687, v_prenex_842, v_prenex_722, v_prenex_689, v_prenex_683, v_arrayElimArr_1, v_prenex_680, v_prenex_681, v_prenex_716, v_prenex_717, v_prenex_718, v_prenex_839, v_prenex_833, v_prenex_679, v_prenex_836, v_prenex_796, v_prenex_830, v_prenex_710, v_prenex_798, v_prenex_832, v_prenex_799, v_prenex_678, v_prenex_792, v_prenex_794, v_prenex_795, v_prenex_790, v_prenex_706, v_prenex_827, v_prenex_708, v_prenex_829, v_prenex_701, v_prenex_822, v_prenex_823, v_prenex_703, v_prenex_704, v_prenex_786, v_prenex_788, v_prenex_781, v_prenex_782, v_prenex_783, v_prenex_784, v_prenex_780, v_prenex_816, v_prenex_811, v_prenex_778, v_prenex_812, v_prenex_779, v_prenex_813, v_prenex_814, v_prenex_774, v_prenex_775, v_prenex_776, v_prenex_810, v_prenex_777, v_prenex_770, v_prenex_771, v_prenex_772, v_prenex_809, v_prenex_805, v_prenex_767, v_prenex_768, v_prenex_802, v_prenex_803, v_prenex_763, v_prenex_885, v_prenex_765, v_prenex_887, v_prenex_766, v_prenex_881, v_prenex_761, v_prenex_883, v_prenex_877, v_prenex_756, v_prenex_878, v_prenex_757, v_prenex_879, v_prenex_758, v_prenex_759, v_prenex_873, v_prenex_752, v_prenex_874, v_prenex_754, v_prenex_876, v_prenex_871, v_prenex_750, v_prenex_749, v_prenex_866, v_prenex_746, v_prenex_869, v_prenex_748, v_prenex_863, v_prenex_743, v_prenex_861, v_prenex_738, v_prenex_734, v_prenex_856, v_prenex_736, v_prenex_857, v_prenex_858, v_prenex_851, v_prenex_731, v_prenex_732, v_prenex_853, v_prenex_694, v_prenex_695, v_prenex_696, v_prenex_692, v_prenex_728, v_prenex_844, v_prenex_724, v_prenex_846]} [2019-11-20 03:48:06,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 03:48:06,179 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 03:48:06,184 INFO L168 Benchmark]: Toolchain (without parser) took 598078.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 485.0 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 624.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:48:06,184 INFO L168 Benchmark]: CDTParser took 0.25 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 03:48:06,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 869.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:48:06,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.15 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:48:06,186 INFO L168 Benchmark]: Boogie Preprocessor took 134.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:48:06,186 INFO L168 Benchmark]: RCFGBuilder took 2603.66 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: 94.9 MB). Peak memory consumption was 94.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:48:06,186 INFO L168 Benchmark]: TraceAbstraction took 594345.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -95.5 MB). Peak memory consumption was 528.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:48:06,189 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.25 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 869.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.15 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2603.66 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: 94.9 MB). Peak memory consumption was 94.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 594345.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -95.5 MB). Peak memory consumption was 528.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...