./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3c39aff9 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/duplets.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c261d11d6e37ef6eda45455c8074b5a0eac3352b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/duplets.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c261d11d6e37ef6eda45455c8074b5a0eac3352b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (exists ((v_mkdup_~j~0_73 (_ BitVec 32)) (|v_main_~#i~2.base_35| (_ BitVec 32)) (|v_main_~#j~2.base_35| (_ BitVec 32)) (v_finddup_~j~1_116 (_ BitVec 32)) (v_mkdup_~i~0_73 (_ BitVec 32))) (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse7 (bvmul v_prenex_42 (_ bv4 32)))) (let ((.cse0 (bvadd |mkdup_#in~a.offset| .cse7 (_ bv4 32))) (.cse3 (bvadd |mkdup_#in~a.offset| .cse7))) (or (not (bvule .cse0 (select (store (store |#length| v_prenex_40 (_ bv4 32)) v_prenex_41 (_ bv4 32)) |mkdup_#in~a.base|))) (let ((.cse1 (bvmul v_finddup_~j~1_116 (_ bv4 32)))) (let ((.cse2 (bvadd |mkdup_#in~a.offset| .cse1 (_ bv4 32)))) (and (bvule (bvadd |mkdup_#in~a.offset| .cse1) .cse2) (bvult |#StackHeapBarrier| |v_main_~#j~2.base_35|) (not (= (bvmul v_mkdup_~j~0_73 (_ bv4 32)) .cse1)) (bvule .cse2 (select (store (store |#length| |v_main_~#i~2.base_35| (_ bv4 32)) |v_main_~#j~2.base_35| (_ bv4 32)) |mkdup_#in~a.base|)) (= (select |#valid| |v_main_~#i~2.base_35|) (_ bv0 1)) (bvsle (_ bv0 32) v_mkdup_~j~0_73) (bvslt v_mkdup_~i~0_73 |mkdup_#in~n|) (not (= .cse1 (bvmul v_mkdup_~i~0_73 (_ bv4 32)))) (not (= v_mkdup_~j~0_73 v_mkdup_~i~0_73)) (bvsle (_ bv0 32) v_mkdup_~i~0_73) (bvslt v_mkdup_~j~0_73 |mkdup_#in~n|)))) (not (bvule .cse3 .cse0)) (let ((.cse4 (bvadd (bvmul mkdup_~i~0 (_ bv4 32)) mkdup_~a.offset)) (.cse5 (bvadd (bvmul mkdup_~j~0 (_ bv4 32)) mkdup_~a.offset))) (and (or (= .cse4 |mkdup_#in~a.offset|) (= .cse5 |mkdup_#in~a.offset|)) (let ((.cse6 (= |mkdup_#in~a.base| mkdup_~a.base))) (or (and (= .cse4 .cse3) .cse6) (and (= .cse5 .cse3) .cse6))))) (= |mkdup_#in~a.offset| .cse3) (bvslt (_ bv2 32) |mkdup_#in~n|) (not (= (select |#valid| v_prenex_40) (_ bv0 1))) (not (bvult |#StackHeapBarrier| v_prenex_41))))))) --- Real Ultimate output --- This is Ultimate 0.1.24-3c39aff [2019-11-27 19:03:00,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 19:03:00,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 19:03:00,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 19:03:00,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 19:03:00,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 19:03:00,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 19:03:00,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 19:03:00,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 19:03:00,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 19:03:00,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 19:03:00,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 19:03:00,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 19:03:00,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 19:03:00,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 19:03:00,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 19:03:00,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 19:03:00,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 19:03:00,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 19:03:00,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 19:03:00,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 19:03:00,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 19:03:00,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 19:03:00,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 19:03:00,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 19:03:00,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 19:03:00,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 19:03:00,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 19:03:00,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 19:03:00,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 19:03:00,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 19:03:00,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 19:03:00,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 19:03:00,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 19:03:00,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 19:03:00,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 19:03:00,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 19:03:00,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 19:03:00,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 19:03:00,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 19:03:00,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 19:03:00,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-27 19:03:00,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 19:03:00,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 19:03:00,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 19:03:00,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 19:03:00,273 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 19:03:00,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 19:03:00,274 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 19:03:00,274 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 19:03:00,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 19:03:00,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 19:03:00,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 19:03:00,275 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 19:03:00,275 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 19:03:00,276 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 19:03:00,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 19:03:00,276 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 19:03:00,277 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 19:03:00,277 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 19:03:00,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 19:03:00,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 19:03:00,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 19:03:00,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 19:03:00,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 19:03:00,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 19:03:00,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 19:03:00,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 19:03:00,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 19:03:00,280 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-27 19:03:00,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 19:03:00,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 19:03:00,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 19:03:00,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 19:03:00,637 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 19:03:00,637 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-27 19:03:00,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e6e3482/1412a6ccd9d5488a850b3c8444695186/FLAGa3379ade9 [2019-11-27 19:03:01,180 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 19:03:01,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-27 19:03:01,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e6e3482/1412a6ccd9d5488a850b3c8444695186/FLAGa3379ade9 [2019-11-27 19:03:01,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e6e3482/1412a6ccd9d5488a850b3c8444695186 [2019-11-27 19:03:01,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 19:03:01,548 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 19:03:01,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 19:03:01,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 19:03:01,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 19:03:01,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b00476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01, skipping insertion in model container [2019-11-27 19:03:01,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 19:03:01,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 19:03:01,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:03:01,835 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 19:03:01,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:03:01,940 INFO L208 MainTranslator]: Completed translation [2019-11-27 19:03:01,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01 WrapperNode [2019-11-27 19:03:01,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 19:03:01,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 19:03:01,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 19:03:01,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 19:03:01,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (1/1) ... [2019-11-27 19:03:01,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 19:03:01,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 19:03:01,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 19:03:01,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 19:03:01,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 19:03:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 19:03:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 19:03:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-27 19:03:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-27 19:03:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-27 19:03:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 19:03:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 19:03:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 19:03:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 19:03:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-27 19:03:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-27 19:03:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 19:03:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-27 19:03:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-27 19:03:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 19:03:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-27 19:03:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 19:03:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 19:03:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 19:03:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 19:03:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 19:03:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 19:03:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 19:03:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 19:03:02,612 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 19:03:02,612 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-27 19:03:02,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:03:02 BoogieIcfgContainer [2019-11-27 19:03:02,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 19:03:02,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 19:03:02,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 19:03:02,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 19:03:02,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:03:01" (1/3) ... [2019-11-27 19:03:02,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5a3042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:03:02, skipping insertion in model container [2019-11-27 19:03:02,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:03:01" (2/3) ... [2019-11-27 19:03:02,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5a3042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:03:02, skipping insertion in model container [2019-11-27 19:03:02,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:03:02" (3/3) ... [2019-11-27 19:03:02,623 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-27 19:03:02,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 19:03:02,641 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-27 19:03:02,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-27 19:03:02,672 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 19:03:02,672 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 19:03:02,672 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 19:03:02,672 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 19:03:02,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 19:03:02,673 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 19:03:02,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 19:03:02,673 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 19:03:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-27 19:03:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 19:03:02,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:02,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:03:02,703 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 205955921, now seen corresponding path program 1 times [2019-11-27 19:03:02,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:02,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150689611] [2019-11-27 19:03:02,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:03,037 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-27 19:03:03,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150689611] [2019-11-27 19:03:03,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:03,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 19:03:03,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90018161] [2019-11-27 19:03:03,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 19:03:03,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:03,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 19:03:03,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:03:03,069 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 8 states. [2019-11-27 19:03:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:03,826 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-27 19:03:03,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 19:03:03,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-27 19:03:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:03,848 INFO L225 Difference]: With dead ends: 105 [2019-11-27 19:03:03,848 INFO L226 Difference]: Without dead ends: 102 [2019-11-27 19:03:03,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:03:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-27 19:03:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-27 19:03:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-27 19:03:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-27 19:03:03,937 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2019-11-27 19:03:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:03,938 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-27 19:03:03,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 19:03:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-27 19:03:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 19:03:03,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:03,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:03:03,941 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash 205955922, now seen corresponding path program 1 times [2019-11-27 19:03:03,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:03,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159543026] [2019-11-27 19:03:03,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:04,200 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-27 19:03:04,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159543026] [2019-11-27 19:03:04,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:04,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 19:03:04,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695982932] [2019-11-27 19:03:04,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 19:03:04,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:04,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 19:03:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:03:04,207 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 8 states. [2019-11-27 19:03:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:04,858 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-11-27 19:03:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 19:03:04,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-27 19:03:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:04,860 INFO L225 Difference]: With dead ends: 101 [2019-11-27 19:03:04,861 INFO L226 Difference]: Without dead ends: 101 [2019-11-27 19:03:04,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:03:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-27 19:03:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-27 19:03:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-27 19:03:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-27 19:03:04,888 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 14 [2019-11-27 19:03:04,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:04,890 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-27 19:03:04,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 19:03:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-11-27 19:03:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 19:03:04,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:04,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:03:04,892 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2089666347, now seen corresponding path program 1 times [2019-11-27 19:03:04,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:04,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528630883] [2019-11-27 19:03:04,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:05,067 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-27 19:03:05,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528630883] [2019-11-27 19:03:05,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:05,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 19:03:05,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693514739] [2019-11-27 19:03:05,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 19:03:05,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:05,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 19:03:05,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:03:05,070 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 8 states. [2019-11-27 19:03:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:05,614 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-11-27 19:03:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 19:03:05,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-27 19:03:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:05,617 INFO L225 Difference]: With dead ends: 100 [2019-11-27 19:03:05,617 INFO L226 Difference]: Without dead ends: 100 [2019-11-27 19:03:05,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:03:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-27 19:03:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-27 19:03:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-27 19:03:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-27 19:03:05,628 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 15 [2019-11-27 19:03:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:05,629 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-27 19:03:05,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 19:03:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-27 19:03:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 19:03:05,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:05,631 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] [2019-11-27 19:03:05,631 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:05,632 INFO L82 PathProgramCache]: Analyzing trace with hash -905694587, now seen corresponding path program 1 times [2019-11-27 19:03:05,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:05,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286541036] [2019-11-27 19:03:05,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:05,774 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-27 19:03:05,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286541036] [2019-11-27 19:03:05,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:05,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 19:03:05,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96844236] [2019-11-27 19:03:05,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 19:03:05,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 19:03:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:03:05,777 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-27 19:03:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:06,264 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-27 19:03:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 19:03:06,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-27 19:03:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:06,266 INFO L225 Difference]: With dead ends: 98 [2019-11-27 19:03:06,267 INFO L226 Difference]: Without dead ends: 98 [2019-11-27 19:03:06,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:03:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-27 19:03:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-27 19:03:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 19:03:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-27 19:03:06,275 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 23 [2019-11-27 19:03:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:06,276 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-27 19:03:06,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 19:03:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-27 19:03:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 19:03:06,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:06,277 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] [2019-11-27 19:03:06,277 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash -905694586, now seen corresponding path program 1 times [2019-11-27 19:03:06,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:06,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463676747] [2019-11-27 19:03:06,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:06,477 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-27 19:03:06,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463676747] [2019-11-27 19:03:06,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:06,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 19:03:06,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248014851] [2019-11-27 19:03:06,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 19:03:06,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:06,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 19:03:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-27 19:03:06,481 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 11 states. [2019-11-27 19:03:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:07,563 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-27 19:03:07,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 19:03:07,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-27 19:03:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:07,566 INFO L225 Difference]: With dead ends: 118 [2019-11-27 19:03:07,566 INFO L226 Difference]: Without dead ends: 118 [2019-11-27 19:03:07,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-11-27 19:03:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-27 19:03:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-11-27 19:03:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-27 19:03:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-27 19:03:07,577 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 23 [2019-11-27 19:03:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:07,578 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-27 19:03:07,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 19:03:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-27 19:03:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 19:03:07,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:07,579 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] [2019-11-27 19:03:07,579 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:07,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1988238866, now seen corresponding path program 1 times [2019-11-27 19:03:07,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:07,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307634144] [2019-11-27 19:03:07,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:07,785 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-27 19:03:07,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307634144] [2019-11-27 19:03:07,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:07,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-27 19:03:07,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460077343] [2019-11-27 19:03:07,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 19:03:07,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 19:03:07,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-27 19:03:07,798 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 12 states. [2019-11-27 19:03:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:08,758 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-11-27 19:03:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 19:03:08,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-27 19:03:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:08,760 INFO L225 Difference]: With dead ends: 101 [2019-11-27 19:03:08,760 INFO L226 Difference]: Without dead ends: 101 [2019-11-27 19:03:08,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-27 19:03:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-27 19:03:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-27 19:03:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-27 19:03:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2019-11-27 19:03:08,783 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 24 [2019-11-27 19:03:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:08,784 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2019-11-27 19:03:08,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 19:03:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2019-11-27 19:03:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 19:03:08,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:08,786 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] [2019-11-27 19:03:08,786 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash -562897614, now seen corresponding path program 1 times [2019-11-27 19:03:08,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:08,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965200190] [2019-11-27 19:03:08,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:08,886 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-27 19:03:08,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965200190] [2019-11-27 19:03:08,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:08,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 19:03:08,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99745053] [2019-11-27 19:03:08,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:03:08,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:03:08,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:03:08,890 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 7 states. [2019-11-27 19:03:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:09,278 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-11-27 19:03:09,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:03:09,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-27 19:03:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:09,280 INFO L225 Difference]: With dead ends: 96 [2019-11-27 19:03:09,281 INFO L226 Difference]: Without dead ends: 96 [2019-11-27 19:03:09,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-27 19:03:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-27 19:03:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-27 19:03:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-27 19:03:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-11-27 19:03:09,288 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 26 [2019-11-27 19:03:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:09,288 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-11-27 19:03:09,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:03:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-11-27 19:03:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 19:03:09,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:09,289 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] [2019-11-27 19:03:09,290 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash -562897613, now seen corresponding path program 1 times [2019-11-27 19:03:09,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:09,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959708519] [2019-11-27 19:03:09,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:09,403 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-27 19:03:09,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959708519] [2019-11-27 19:03:09,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:09,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 19:03:09,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695110550] [2019-11-27 19:03:09,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:03:09,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:09,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:03:09,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:03:09,405 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 7 states. [2019-11-27 19:03:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:09,843 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2019-11-27 19:03:09,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:03:09,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-27 19:03:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:09,845 INFO L225 Difference]: With dead ends: 91 [2019-11-27 19:03:09,846 INFO L226 Difference]: Without dead ends: 91 [2019-11-27 19:03:09,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-27 19:03:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-27 19:03:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-11-27 19:03:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-27 19:03:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-11-27 19:03:09,867 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 26 [2019-11-27 19:03:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:09,870 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-11-27 19:03:09,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:03:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-11-27 19:03:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 19:03:09,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:09,875 INFO L410 BasicCegarLoop]: trace histogram [2, 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-27 19:03:09,875 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash -564101073, now seen corresponding path program 1 times [2019-11-27 19:03:09,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:09,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433529926] [2019-11-27 19:03:09,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:10,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433529926] [2019-11-27 19:03:10,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250065161] [2019-11-27 19:03:10,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 19:03:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 19:03:10,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:03:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:10,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 19:03:10,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-27 19:03:10,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278013495] [2019-11-27 19:03:10,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 19:03:10,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:10,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 19:03:10,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:03:10,154 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 5 states. [2019-11-27 19:03:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:10,219 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2019-11-27 19:03:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 19:03:10,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-27 19:03:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:10,221 INFO L225 Difference]: With dead ends: 114 [2019-11-27 19:03:10,221 INFO L226 Difference]: Without dead ends: 114 [2019-11-27 19:03:10,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-27 19:03:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-27 19:03:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2019-11-27 19:03:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 19:03:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-27 19:03:10,228 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 26 [2019-11-27 19:03:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:10,228 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-27 19:03:10,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 19:03:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-27 19:03:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 19:03:10,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:10,230 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] [2019-11-27 19:03:10,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:10,431 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash -269956851, now seen corresponding path program 1 times [2019-11-27 19:03:10,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:10,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523487779] [2019-11-27 19:03:10,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,521 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-27 19:03:10,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523487779] [2019-11-27 19:03:10,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:10,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 19:03:10,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652053231] [2019-11-27 19:03:10,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:03:10,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:10,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:03:10,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:03:10,523 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 7 states. [2019-11-27 19:03:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:10,873 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-27 19:03:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:03:10,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-27 19:03:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:10,875 INFO L225 Difference]: With dead ends: 90 [2019-11-27 19:03:10,875 INFO L226 Difference]: Without dead ends: 90 [2019-11-27 19:03:10,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-27 19:03:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-27 19:03:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-27 19:03:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-27 19:03:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-27 19:03:10,887 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 27 [2019-11-27 19:03:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:10,887 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-27 19:03:10,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:03:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-27 19:03:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 19:03:10,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:10,889 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] [2019-11-27 19:03:10,890 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:10,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:10,891 INFO L82 PathProgramCache]: Analyzing trace with hash -269956850, now seen corresponding path program 1 times [2019-11-27 19:03:10,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:10,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950778406] [2019-11-27 19:03:10,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:11,010 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-27 19:03:11,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950778406] [2019-11-27 19:03:11,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:11,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 19:03:11,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074301533] [2019-11-27 19:03:11,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:03:11,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:11,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:03:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:03:11,013 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 7 states. [2019-11-27 19:03:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:11,355 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-27 19:03:11,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:03:11,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-27 19:03:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:11,357 INFO L225 Difference]: With dead ends: 85 [2019-11-27 19:03:11,358 INFO L226 Difference]: Without dead ends: 85 [2019-11-27 19:03:11,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-27 19:03:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-27 19:03:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-11-27 19:03:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-27 19:03:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-11-27 19:03:11,362 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 27 [2019-11-27 19:03:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:11,363 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-11-27 19:03:11,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:03:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-11-27 19:03:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 19:03:11,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:11,364 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] [2019-11-27 19:03:11,364 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash -800191309, now seen corresponding path program 1 times [2019-11-27 19:03:11,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:11,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574144867] [2019-11-27 19:03:11,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:11,542 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-27 19:03:11,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574144867] [2019-11-27 19:03:11,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:11,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 19:03:11,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299050672] [2019-11-27 19:03:11,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 19:03:11,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:11,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 19:03:11,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-27 19:03:11,544 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 10 states. [2019-11-27 19:03:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:12,108 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-11-27 19:03:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 19:03:12,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-27 19:03:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:12,111 INFO L225 Difference]: With dead ends: 95 [2019-11-27 19:03:12,111 INFO L226 Difference]: Without dead ends: 92 [2019-11-27 19:03:12,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-27 19:03:12,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-27 19:03:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-11-27 19:03:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-27 19:03:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-11-27 19:03:12,117 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 29 [2019-11-27 19:03:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:12,118 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-11-27 19:03:12,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 19:03:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-11-27 19:03:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 19:03:12,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:12,123 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] [2019-11-27 19:03:12,124 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:12,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2100210528, now seen corresponding path program 1 times [2019-11-27 19:03:12,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:12,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104504888] [2019-11-27 19:03:12,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:12,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104504888] [2019-11-27 19:03:12,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988521501] [2019-11-27 19:03:12,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 19:03:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:12,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 19:03:12,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:03:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:12,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:03:12,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-27 19:03:12,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114913962] [2019-11-27 19:03:12,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 19:03:12,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:12,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 19:03:12,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:03:12,297 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 9 states. [2019-11-27 19:03:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:12,760 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2019-11-27 19:03:12,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 19:03:12,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-27 19:03:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:12,762 INFO L225 Difference]: With dead ends: 121 [2019-11-27 19:03:12,763 INFO L226 Difference]: Without dead ends: 121 [2019-11-27 19:03:12,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-27 19:03:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-27 19:03:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-11-27 19:03:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 19:03:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2019-11-27 19:03:12,775 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 31 [2019-11-27 19:03:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:12,777 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2019-11-27 19:03:12,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 19:03:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2019-11-27 19:03:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 19:03:12,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:12,778 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] [2019-11-27 19:03:12,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:12,979 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1534703516, now seen corresponding path program 1 times [2019-11-27 19:03:12,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:12,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121355064] [2019-11-27 19:03:12,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:13,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121355064] [2019-11-27 19:03:13,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740118406] [2019-11-27 19:03:13,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:13,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 19:03:13,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:03:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:13,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:03:13,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2019-11-27 19:03:13,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820893447] [2019-11-27 19:03:13,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 19:03:13,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:13,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 19:03:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:03:13,512 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 14 states. [2019-11-27 19:03:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:14,280 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-27 19:03:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 19:03:14,281 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-27 19:03:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:14,283 INFO L225 Difference]: With dead ends: 115 [2019-11-27 19:03:14,283 INFO L226 Difference]: Without dead ends: 110 [2019-11-27 19:03:14,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2019-11-27 19:03:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-27 19:03:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2019-11-27 19:03:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 19:03:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2019-11-27 19:03:14,289 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 32 [2019-11-27 19:03:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:14,289 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2019-11-27 19:03:14,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 19:03:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2019-11-27 19:03:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 19:03:14,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:14,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:03:14,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:14,500 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1149138921, now seen corresponding path program 1 times [2019-11-27 19:03:14,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:14,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379174107] [2019-11-27 19:03:14,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:14,593 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-27 19:03:14,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379174107] [2019-11-27 19:03:14,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:14,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 19:03:14,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565756259] [2019-11-27 19:03:14,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 19:03:14,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 19:03:14,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:03:14,596 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 9 states. [2019-11-27 19:03:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:14,949 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2019-11-27 19:03:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 19:03:14,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-27 19:03:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:14,952 INFO L225 Difference]: With dead ends: 135 [2019-11-27 19:03:14,952 INFO L226 Difference]: Without dead ends: 135 [2019-11-27 19:03:14,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-27 19:03:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-27 19:03:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2019-11-27 19:03:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-27 19:03:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2019-11-27 19:03:14,963 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 35 [2019-11-27 19:03:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:14,964 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-11-27 19:03:14,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 19:03:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2019-11-27 19:03:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 19:03:14,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:14,966 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 19:03:14,966 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:14,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1466392881, now seen corresponding path program 2 times [2019-11-27 19:03:14,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:14,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722983391] [2019-11-27 19:03:14,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:15,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722983391] [2019-11-27 19:03:15,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624540197] [2019-11-27 19:03:15,108 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:15,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 19:03:15,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 19:03:15,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 19:03:15,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:03:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:15,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:03:15,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-27 19:03:15,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393984184] [2019-11-27 19:03:15,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 19:03:15,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 19:03:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-27 19:03:15,385 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 17 states. [2019-11-27 19:03:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:16,556 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2019-11-27 19:03:16,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 19:03:16,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-27 19:03:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:16,557 INFO L225 Difference]: With dead ends: 131 [2019-11-27 19:03:16,558 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 19:03:16,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-11-27 19:03:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 19:03:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2019-11-27 19:03:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 19:03:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-11-27 19:03:16,564 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 36 [2019-11-27 19:03:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:16,564 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-11-27 19:03:16,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 19:03:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-11-27 19:03:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 19:03:16,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:16,565 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] [2019-11-27 19:03:16,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:16,769 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash -291785907, now seen corresponding path program 1 times [2019-11-27 19:03:16,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:16,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315505053] [2019-11-27 19:03:16,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:16,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315505053] [2019-11-27 19:03:16,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763670330] [2019-11-27 19:03:16,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:16,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 19:03:16,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:03:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:16,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:03:16,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-11-27 19:03:16,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127347835] [2019-11-27 19:03:16,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:03:16,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:03:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:03:16,900 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2019-11-27 19:03:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:17,154 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-11-27 19:03:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:03:17,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-27 19:03:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:17,156 INFO L225 Difference]: With dead ends: 93 [2019-11-27 19:03:17,156 INFO L226 Difference]: Without dead ends: 93 [2019-11-27 19:03:17,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-27 19:03:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-27 19:03:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-11-27 19:03:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 19:03:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-11-27 19:03:17,161 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 37 [2019-11-27 19:03:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:17,161 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-11-27 19:03:17,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:03:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-11-27 19:03:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 19:03:17,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:17,162 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] [2019-11-27 19:03:17,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:17,365 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -909618494, now seen corresponding path program 2 times [2019-11-27 19:03:17,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:17,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979364138] [2019-11-27 19:03:17,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:17,872 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-11-27 19:03:18,104 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 64 [2019-11-27 19:03:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 19:03:18,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979364138] [2019-11-27 19:03:18,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790439199] [2019-11-27 19:03:18,551 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:18,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 19:03:18,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 19:03:18,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-27 19:03:18,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:03:18,704 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 15 treesize of output 11 [2019-11-27 19:03:18,705 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:18,726 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:18,728 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:03:18,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-11-27 19:03:18,798 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-27 19:03:18,799 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 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-27 19:03:18,800 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:18,812 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:18,813 INFO L508 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-27 19:03:18,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-11-27 19:03:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 19:03:20,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:03:20,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2019-11-27 19:03:20,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420208573] [2019-11-27 19:03:20,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-27 19:03:20,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-27 19:03:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-11-27 19:03:20,234 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 29 states. [2019-11-27 19:03:21,391 WARN L192 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-11-27 19:03:21,944 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-27 19:03:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:30,700 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2019-11-27 19:03:30,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-27 19:03:30,701 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2019-11-27 19:03:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:30,702 INFO L225 Difference]: With dead ends: 187 [2019-11-27 19:03:30,702 INFO L226 Difference]: Without dead ends: 179 [2019-11-27 19:03:30,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=234, Invalid=1836, Unknown=0, NotChecked=0, Total=2070 [2019-11-27 19:03:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-27 19:03:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 98. [2019-11-27 19:03:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-27 19:03:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-27 19:03:30,711 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 40 [2019-11-27 19:03:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:30,712 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-27 19:03:30,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-27 19:03:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-27 19:03:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 19:03:30,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:30,713 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:03:30,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:30,914 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1547438402, now seen corresponding path program 1 times [2019-11-27 19:03:30,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:30,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142478375] [2019-11-27 19:03:30,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:31,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142478375] [2019-11-27 19:03:31,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:03:31,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-27 19:03:31,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785973492] [2019-11-27 19:03:31,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 19:03:31,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:31,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 19:03:31,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-27 19:03:31,126 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 15 states. [2019-11-27 19:03:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:32,039 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2019-11-27 19:03:32,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 19:03:32,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-11-27 19:03:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:32,042 INFO L225 Difference]: With dead ends: 140 [2019-11-27 19:03:32,042 INFO L226 Difference]: Without dead ends: 140 [2019-11-27 19:03:32,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-11-27 19:03:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-27 19:03:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2019-11-27 19:03:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-27 19:03:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-27 19:03:32,049 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43 [2019-11-27 19:03:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:32,049 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-27 19:03:32,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 19:03:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-27 19:03:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 19:03:32,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:32,050 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:03:32,051 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:32,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:32,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1715645055, now seen corresponding path program 1 times [2019-11-27 19:03:32,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:32,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773948510] [2019-11-27 19:03:32,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:32,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773948510] [2019-11-27 19:03:32,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677570126] [2019-11-27 19:03:32,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:32,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-27 19:03:32,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:03:32,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 19:03:32,901 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:32,909 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:32,909 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:03:32,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-27 19:03:33,065 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 11 treesize of output 7 [2019-11-27 19:03:33,066 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:33,076 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:33,077 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:03:33,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-27 19:03:33,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:33,139 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 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-27 19:03:33,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:03:33,142 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:33,170 INFO L588 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-27 19:03:33,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:03:33,172 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:03:33,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:31 [2019-11-27 19:03:33,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:03:33,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:03:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:03:33,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:03:33,529 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 30 treesize of output 14 [2019-11-27 19:03:33,530 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:33,541 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:33,542 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:03:33,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:12 [2019-11-27 19:03:33,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:03:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:33,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:03:33,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 35 [2019-11-27 19:03:33,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996926379] [2019-11-27 19:03:33,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-27 19:03:33,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-27 19:03:33,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2019-11-27 19:03:33,643 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 35 states. [2019-11-27 19:03:38,739 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-27 19:03:40,942 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-27 19:03:41,206 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-27 19:03:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:03:43,934 INFO L93 Difference]: Finished difference Result 183 states and 206 transitions. [2019-11-27 19:03:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-27 19:03:43,935 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-11-27 19:03:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:03:43,937 INFO L225 Difference]: With dead ends: 183 [2019-11-27 19:03:43,937 INFO L226 Difference]: Without dead ends: 183 [2019-11-27 19:03:43,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=463, Invalid=3959, Unknown=0, NotChecked=0, Total=4422 [2019-11-27 19:03:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-27 19:03:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2019-11-27 19:03:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-27 19:03:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-11-27 19:03:43,946 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 45 [2019-11-27 19:03:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:03:43,946 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-11-27 19:03:43,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-27 19:03:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-11-27 19:03:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 19:03:43,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:03:43,947 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] [2019-11-27 19:03:44,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:44,151 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:03:44,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:03:44,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1209011571, now seen corresponding path program 3 times [2019-11-27 19:03:44,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:03:44,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344804597] [2019-11-27 19:03:44,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:03:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:03:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:03:44,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344804597] [2019-11-27 19:03:44,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233610800] [2019-11-27 19:03:44,251 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:03:44,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 19:03:44,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 19:03:44,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-27 19:03:44,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:03:44,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-27 19:03:44,327 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:44,334 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:44,335 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:03:44,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-27 19:03:44,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-27 19:03:44,497 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:44,532 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:44,534 INFO L508 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-27 19:03:44,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:68 [2019-11-27 19:03:44,626 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-27 19:03:44,626 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 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-27 19:03:44,626 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:44,651 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:44,652 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 19:03:44,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:70 [2019-11-27 19:03:44,866 INFO L404 ElimStorePlain]: Different costs {2=[|v_#length_41|], 4=[|v_#valid_52|]} [2019-11-27 19:03:44,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:03:44,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:03:44,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:03:44,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-11-27 19:03:44,885 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:44,922 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:44,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:03:44,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:03:44,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:44,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 22 [2019-11-27 19:03:44,941 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:44,971 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:44,972 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 19:03:44,973 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:67 [2019-11-27 19:03:45,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:03:45,053 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 19 treesize of output 3 [2019-11-27 19:03:45,054 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:03:45,087 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:03:45,090 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 19:03:45,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:87, output treesize:51 [2019-11-27 19:03:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 19:03:46,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:03:46,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20] total 27 [2019-11-27 19:03:46,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835333256] [2019-11-27 19:03:46,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-27 19:03:46,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:03:46,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-27 19:03:46,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-11-27 19:03:46,239 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 27 states. [2019-11-27 19:03:49,192 WARN L192 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-27 19:03:50,996 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-27 19:04:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:04:15,989 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2019-11-27 19:04:15,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-27 19:04:15,990 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2019-11-27 19:04:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:04:15,991 INFO L225 Difference]: With dead ends: 190 [2019-11-27 19:04:15,992 INFO L226 Difference]: Without dead ends: 190 [2019-11-27 19:04:15,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=743, Invalid=3541, Unknown=6, NotChecked=0, Total=4290 [2019-11-27 19:04:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-27 19:04:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 145. [2019-11-27 19:04:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-27 19:04:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2019-11-27 19:04:16,001 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 45 [2019-11-27 19:04:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:04:16,001 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2019-11-27 19:04:16,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-27 19:04:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2019-11-27 19:04:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-27 19:04:16,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:04:16,003 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:04:16,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 19:04:16,207 INFO L410 AbstractCegarLoop]: === Iteration 22 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:04:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:04:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash 936948074, now seen corresponding path program 1 times [2019-11-27 19:04:16,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:04:16,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797928737] [2019-11-27 19:04:16,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:04:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 19:04:16,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797928737] [2019-11-27 19:04:16,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:04:16,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-27 19:04:16,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126318389] [2019-11-27 19:04:16,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 19:04:16,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:04:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 19:04:16,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-27 19:04:16,403 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 12 states. [2019-11-27 19:04:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:04:17,135 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2019-11-27 19:04:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 19:04:17,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-27 19:04:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:04:17,139 INFO L225 Difference]: With dead ends: 151 [2019-11-27 19:04:17,139 INFO L226 Difference]: Without dead ends: 151 [2019-11-27 19:04:17,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-11-27 19:04:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-27 19:04:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-11-27 19:04:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-27 19:04:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2019-11-27 19:04:17,145 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 54 [2019-11-27 19:04:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:04:17,146 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2019-11-27 19:04:17,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 19:04:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2019-11-27 19:04:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-27 19:04:17,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:04:17,147 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-27 19:04:17,147 INFO L410 AbstractCegarLoop]: === Iteration 23 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:04:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:04:17,147 INFO L82 PathProgramCache]: Analyzing trace with hash -21831271, now seen corresponding path program 4 times [2019-11-27 19:04:17,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:04:17,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123961047] [2019-11-27 19:04:17,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:04:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:17,239 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1315) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1196) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-27 19:04:17,244 INFO L168 Benchmark]: Toolchain (without parser) took 75696.66 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 421.0 MB). Free memory was 957.7 MB in the beginning and 972.2 MB in the end (delta: -14.5 MB). Peak memory consumption was 406.5 MB. Max. memory is 11.5 GB. [2019-11-27 19:04:17,244 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 19:04:17,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-27 19:04:17,245 INFO L168 Benchmark]: Boogie Preprocessor took 52.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 19:04:17,246 INFO L168 Benchmark]: RCFGBuilder took 618.54 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: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-11-27 19:04:17,246 INFO L168 Benchmark]: TraceAbstraction took 74627.55 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.0 MB). Free memory was 1.1 GB in the beginning and 972.2 MB in the end (delta: 114.1 MB). Peak memory consumption was 406.1 MB. Max. memory is 11.5 GB. [2019-11-27 19:04:17,250 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.62 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 618.54 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: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74627.55 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.0 MB). Free memory was 1.1 GB in the beginning and 972.2 MB in the end (delta: 114.1 MB). Peak memory consumption was 406.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-3c39aff [2019-11-27 19:04:19,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 19:04:19,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 19:04:19,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 19:04:19,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 19:04:19,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 19:04:19,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 19:04:19,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 19:04:19,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 19:04:19,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 19:04:19,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 19:04:19,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 19:04:19,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 19:04:19,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 19:04:19,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 19:04:19,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 19:04:19,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 19:04:19,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 19:04:19,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 19:04:19,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 19:04:19,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 19:04:19,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 19:04:19,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 19:04:19,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 19:04:19,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 19:04:19,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 19:04:19,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 19:04:19,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 19:04:19,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 19:04:19,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 19:04:19,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 19:04:19,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 19:04:19,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 19:04:19,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 19:04:19,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 19:04:19,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 19:04:19,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 19:04:19,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 19:04:19,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 19:04:19,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 19:04:19,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 19:04:19,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-27 19:04:19,417 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 19:04:19,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 19:04:19,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 19:04:19,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 19:04:19,420 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 19:04:19,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 19:04:19,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 19:04:19,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 19:04:19,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 19:04:19,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 19:04:19,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 19:04:19,423 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 19:04:19,424 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 19:04:19,424 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-27 19:04:19,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 19:04:19,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 19:04:19,425 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 19:04:19,425 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 19:04:19,426 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 19:04:19,426 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 19:04:19,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 19:04:19,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 19:04:19,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 19:04:19,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 19:04:19,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 19:04:19,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 19:04:19,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 19:04:19,429 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 19:04:19,429 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 19:04:19,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 19:04:19,429 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-27 19:04:19,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 19:04:19,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 19:04:19,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 19:04:19,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 19:04:19,759 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 19:04:19,760 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-27 19:04:19,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46649242/54d5695e417146ab89b71326de8410fe/FLAGafed9f959 [2019-11-27 19:04:20,291 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 19:04:20,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-27 19:04:20,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46649242/54d5695e417146ab89b71326de8410fe/FLAGafed9f959 [2019-11-27 19:04:20,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46649242/54d5695e417146ab89b71326de8410fe [2019-11-27 19:04:20,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 19:04:20,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 19:04:20,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 19:04:20,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 19:04:20,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 19:04:20,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:04:20" (1/1) ... [2019-11-27 19:04:20,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c44cb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:20, skipping insertion in model container [2019-11-27 19:04:20,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:04:20" (1/1) ... [2019-11-27 19:04:20,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 19:04:20,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 19:04:20,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:04:20,950 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 19:04:21,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:04:21,070 INFO L208 MainTranslator]: Completed translation [2019-11-27 19:04:21,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21 WrapperNode [2019-11-27 19:04:21,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 19:04:21,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 19:04:21,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 19:04:21,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 19:04:21,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (1/1) ... [2019-11-27 19:04:21,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (1/1) ... [2019-11-27 19:04:21,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (1/1) ... [2019-11-27 19:04:21,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (1/1) ... [2019-11-27 19:04:21,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (1/1) ... [2019-11-27 19:04:21,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (1/1) ... [2019-11-27 19:04:21,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (1/1) ... [2019-11-27 19:04:21,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 19:04:21,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 19:04:21,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 19:04:21,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 19:04:21,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 19:04:21,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 19:04:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 19:04:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-27 19:04:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-27 19:04:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-27 19:04:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 19:04:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-27 19:04:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 19:04:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 19:04:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-27 19:04:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-27 19:04:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 19:04:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-27 19:04:21,185 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-27 19:04:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 19:04:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-27 19:04:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 19:04:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 19:04:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 19:04:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 19:04:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-27 19:04:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 19:04:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 19:04:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 19:04:21,893 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 19:04:21,893 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-27 19:04:21,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:04:21 BoogieIcfgContainer [2019-11-27 19:04:21,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 19:04:21,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 19:04:21,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 19:04:21,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 19:04:21,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:04:20" (1/3) ... [2019-11-27 19:04:21,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1657756f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:04:21, skipping insertion in model container [2019-11-27 19:04:21,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:04:21" (2/3) ... [2019-11-27 19:04:21,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1657756f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:04:21, skipping insertion in model container [2019-11-27 19:04:21,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:04:21" (3/3) ... [2019-11-27 19:04:21,904 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-27 19:04:21,914 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 19:04:21,922 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-11-27 19:04:21,935 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-11-27 19:04:21,954 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 19:04:21,954 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 19:04:21,954 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 19:04:21,954 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 19:04:21,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 19:04:21,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 19:04:21,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 19:04:21,955 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 19:04:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-27 19:04:21,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 19:04:21,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:04:21,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:04:21,988 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:04:21,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:04:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash 205955921, now seen corresponding path program 1 times [2019-11-27 19:04:22,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:04:22,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620597578] [2019-11-27 19:04:22,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 19:04:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:22,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 19:04:22,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:04:22,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 19:04:22,180 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:04:22,191 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:04:22,192 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:04:22,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 19:04:22,294 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-27 19:04:22,295 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:04:22,333 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-27 19:04:22,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620597578] [2019-11-27 19:04:22,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:04:22,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-27 19:04:22,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077358520] [2019-11-27 19:04:22,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:04:22,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:04:22,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:04:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:04:22,364 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 7 states. [2019-11-27 19:04:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:04:22,972 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-27 19:04:22,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 19:04:22,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-27 19:04:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:04:22,986 INFO L225 Difference]: With dead ends: 103 [2019-11-27 19:04:22,986 INFO L226 Difference]: Without dead ends: 100 [2019-11-27 19:04:22,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:04:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-27 19:04:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-27 19:04:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-27 19:04:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-27 19:04:23,042 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2019-11-27 19:04:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:04:23,043 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-27 19:04:23,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:04:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-27 19:04:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 19:04:23,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:04:23,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:04:23,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 19:04:23,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:04:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:04:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash 205955922, now seen corresponding path program 1 times [2019-11-27 19:04:23,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:04:23,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067424903] [2019-11-27 19:04:23,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 19:04:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:04:23,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-27 19:04:23,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:04:23,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-27 19:04:23,364 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:04:23,379 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:04:23,380 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:04:23,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-27 19:04:23,667 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-27 19:04:23,667 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:04:25,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:04:26,583 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-27 19:04:26,817 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-27 19:04:27,302 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-27 19:04:27,336 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-27 19:04:27,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067424903] [2019-11-27 19:04:27,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:04:27,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-27 19:04:27,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583171520] [2019-11-27 19:04:27,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 19:04:27,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:04:27,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 19:04:27,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2019-11-27 19:04:27,341 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2019-11-27 19:05:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:03,993 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-27 19:05:03,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 19:05:03,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-11-27 19:05:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:03,996 INFO L225 Difference]: With dead ends: 99 [2019-11-27 19:05:03,997 INFO L226 Difference]: Without dead ends: 99 [2019-11-27 19:05:03,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-11-27 19:05:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-27 19:05:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-27 19:05:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-27 19:05:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-11-27 19:05:04,011 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 14 [2019-11-27 19:05:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:04,012 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-11-27 19:05:04,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 19:05:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-11-27 19:05:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 19:05:04,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:04,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:05:04,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 19:05:04,215 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2089666347, now seen corresponding path program 1 times [2019-11-27 19:05:04,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:04,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340421167] [2019-11-27 19:05:04,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:04,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-27 19:05:04,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:04,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-27 19:05:04,298 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:04,310 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:04,311 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:05:04,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-27 19:05:04,692 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-27 19:05:04,693 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:04,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:07,543 WARN L192 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-11-27 19:05:07,928 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-27 19:05:07,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340421167] [2019-11-27 19:05:07,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:07,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-27 19:05:07,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708149889] [2019-11-27 19:05:07,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 19:05:07,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:07,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 19:05:07,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2019-11-27 19:05:07,931 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 11 states. [2019-11-27 19:05:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:12,619 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-27 19:05:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 19:05:12,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-27 19:05:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:12,622 INFO L225 Difference]: With dead ends: 98 [2019-11-27 19:05:12,622 INFO L226 Difference]: Without dead ends: 98 [2019-11-27 19:05:12,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-11-27 19:05:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-27 19:05:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-27 19:05:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-27 19:05:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-27 19:05:12,633 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 15 [2019-11-27 19:05:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:12,633 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-27 19:05:12,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 19:05:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-27 19:05:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 19:05:12,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:12,635 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] [2019-11-27 19:05:12,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 19:05:12,845 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -905694587, now seen corresponding path program 1 times [2019-11-27 19:05:12,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:12,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253391393] [2019-11-27 19:05:12,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:12,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 19:05:12,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:12,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 19:05:12,998 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:13,000 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:13,000 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:05:13,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 19:05:13,162 INFO L343 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-11-27 19:05:13,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 49 [2019-11-27 19:05:13,164 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:13,195 INFO L588 ElimStorePlain]: treesize reduction 17, result has 54.1 percent of original size [2019-11-27 19:05:13,196 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:13,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2019-11-27 19:05:13,263 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-27 19:05:13,263 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:13,412 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-27 19:05:13,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253391393] [2019-11-27 19:05:13,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:13,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-27 19:05:13,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508985717] [2019-11-27 19:05:13,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 19:05:13,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:13,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 19:05:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-27 19:05:13,415 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 12 states. [2019-11-27 19:05:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:14,137 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-27 19:05:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 19:05:14,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-27 19:05:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:14,140 INFO L225 Difference]: With dead ends: 96 [2019-11-27 19:05:14,140 INFO L226 Difference]: Without dead ends: 96 [2019-11-27 19:05:14,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-27 19:05:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-27 19:05:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-27 19:05:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 19:05:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-27 19:05:14,152 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 23 [2019-11-27 19:05:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:14,153 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-27 19:05:14,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 19:05:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-27 19:05:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 19:05:14,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:14,154 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] [2019-11-27 19:05:14,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 19:05:14,357 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash -905694586, now seen corresponding path program 1 times [2019-11-27 19:05:14,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:14,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557430039] [2019-11-27 19:05:14,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:14,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-27 19:05:14,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:14,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 19:05:14,435 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:14,451 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:14,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-27 19:05:14,455 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:14,480 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:14,481 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:05:14,481 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-11-27 19:05:14,747 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_72|], 2=[|v_#length_48|]} [2019-11-27 19:05:14,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:14,774 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 13 treesize of output 17 [2019-11-27 19:05:14,775 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:14,830 INFO L588 ElimStorePlain]: treesize reduction 3, result has 91.7 percent of original size [2019-11-27 19:05:14,897 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-11-27 19:05:14,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 35 [2019-11-27 19:05:14,898 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:14,970 INFO L588 ElimStorePlain]: treesize reduction 10, result has 79.2 percent of original size [2019-11-27 19:05:14,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:14,974 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:14,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:38 [2019-11-27 19:05:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:15,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:15,205 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-27 19:05:15,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:15,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:05:15,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:15,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:15,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:15,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:15,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:15,832 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2019-11-27 19:05:18,347 WARN L192 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2019-11-27 19:05:19,054 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-27 19:05:19,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557430039] [2019-11-27 19:05:19,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:19,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-27 19:05:19,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028230801] [2019-11-27 19:05:19,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 19:05:19,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:19,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 19:05:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-27 19:05:19,057 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 17 states. [2019-11-27 19:05:19,823 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-27 19:05:21,035 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-27 19:05:23,151 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-27 19:05:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:23,205 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-27 19:05:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 19:05:23,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-11-27 19:05:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:23,209 INFO L225 Difference]: With dead ends: 118 [2019-11-27 19:05:23,209 INFO L226 Difference]: Without dead ends: 118 [2019-11-27 19:05:23,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-11-27 19:05:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-27 19:05:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2019-11-27 19:05:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-27 19:05:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-11-27 19:05:23,220 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 23 [2019-11-27 19:05:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:23,220 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-11-27 19:05:23,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 19:05:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-11-27 19:05:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 19:05:23,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:23,221 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] [2019-11-27 19:05:23,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 19:05:23,431 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:23,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:23,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1988238866, now seen corresponding path program 1 times [2019-11-27 19:05:23,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:23,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450574396] [2019-11-27 19:05:23,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:23,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-27 19:05:23,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:23,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-27 19:05:23,591 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:23,614 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:23,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 19:05:23,620 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:23,642 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:23,642 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:05:23,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-11-27 19:05:23,846 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_79|], 2=[|v_#length_52|]} [2019-11-27 19:05:23,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:23,860 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 13 treesize of output 17 [2019-11-27 19:05:23,860 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:23,894 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:23,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:05:23,923 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 19:05:23,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-27 19:05:23,924 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:23,953 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:23,954 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:23,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:37 [2019-11-27 19:05:24,357 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-27 19:05:24,357 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:25,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:26,543 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-27 19:05:26,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450574396] [2019-11-27 19:05:26,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:26,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2019-11-27 19:05:26,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660646218] [2019-11-27 19:05:26,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-27 19:05:26,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-27 19:05:26,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-27 19:05:26,545 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 19 states. [2019-11-27 19:05:28,814 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-27 19:05:29,116 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-27 19:05:29,375 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-27 19:05:29,664 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-27 19:05:30,208 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-27 19:05:30,956 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-27 19:05:31,596 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-27 19:05:32,290 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-27 19:05:33,182 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-27 19:05:33,570 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-27 19:05:33,979 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-27 19:05:34,808 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-27 19:05:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:38,015 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2019-11-27 19:05:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 19:05:38,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-27 19:05:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:38,018 INFO L225 Difference]: With dead ends: 164 [2019-11-27 19:05:38,019 INFO L226 Difference]: Without dead ends: 164 [2019-11-27 19:05:38,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 19:05:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-27 19:05:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 115. [2019-11-27 19:05:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-27 19:05:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-11-27 19:05:38,029 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 24 [2019-11-27 19:05:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:38,029 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-11-27 19:05:38,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-27 19:05:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-11-27 19:05:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 19:05:38,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:38,031 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] [2019-11-27 19:05:38,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 19:05:38,242 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash -562897614, now seen corresponding path program 1 times [2019-11-27 19:05:38,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:38,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784532309] [2019-11-27 19:05:38,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:38,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 19:05:38,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:38,346 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 19:05:38,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-27 19:05:38,347 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:38,354 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:38,355 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:38,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-27 19:05:38,397 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-27 19:05:38,398 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:38,453 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-27 19:05:38,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784532309] [2019-11-27 19:05:38,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:38,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-27 19:05:38,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469662596] [2019-11-27 19:05:38,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 19:05:38,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:38,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 19:05:38,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:05:38,456 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 8 states. [2019-11-27 19:05:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:38,843 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-27 19:05:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:05:38,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-27 19:05:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:38,846 INFO L225 Difference]: With dead ends: 110 [2019-11-27 19:05:38,846 INFO L226 Difference]: Without dead ends: 110 [2019-11-27 19:05:38,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:05:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-27 19:05:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-27 19:05:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-27 19:05:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2019-11-27 19:05:38,855 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 26 [2019-11-27 19:05:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:38,855 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2019-11-27 19:05:38,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 19:05:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2019-11-27 19:05:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 19:05:38,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:38,857 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] [2019-11-27 19:05:39,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 19:05:39,067 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:39,068 INFO L82 PathProgramCache]: Analyzing trace with hash -562897613, now seen corresponding path program 1 times [2019-11-27 19:05:39,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:39,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044816735] [2019-11-27 19:05:39,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:39,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 19:05:39,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:39,189 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_56|], 1=[|v_#valid_90|]} [2019-11-27 19:05:39,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:05:39,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 19:05:39,197 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:39,213 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:39,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 19:05:39,220 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:39,232 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:39,233 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:39,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2019-11-27 19:05:39,316 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-27 19:05:39,317 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:39,449 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-27 19:05:39,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044816735] [2019-11-27 19:05:39,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:39,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-27 19:05:39,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050803191] [2019-11-27 19:05:39,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 19:05:39,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 19:05:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:05:39,452 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand 8 states. [2019-11-27 19:05:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:40,089 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2019-11-27 19:05:40,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:05:40,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-27 19:05:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:40,091 INFO L225 Difference]: With dead ends: 105 [2019-11-27 19:05:40,091 INFO L226 Difference]: Without dead ends: 105 [2019-11-27 19:05:40,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:05:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-27 19:05:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-27 19:05:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-27 19:05:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-27 19:05:40,098 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 26 [2019-11-27 19:05:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:40,098 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-27 19:05:40,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 19:05:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-11-27 19:05:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 19:05:40,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:40,100 INFO L410 BasicCegarLoop]: trace histogram [2, 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-27 19:05:40,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 19:05:40,311 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:40,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash -564101073, now seen corresponding path program 1 times [2019-11-27 19:05:40,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:40,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945621619] [2019-11-27 19:05:40,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:40,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 19:05:40,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:05:40,567 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:05:40,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945621619] [2019-11-27 19:05:40,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:40,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-27 19:05:40,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690981543] [2019-11-27 19:05:40,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 19:05:40,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 19:05:40,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-27 19:05:40,867 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 13 states. [2019-11-27 19:05:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:41,492 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2019-11-27 19:05:41,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 19:05:41,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-11-27 19:05:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:41,497 INFO L225 Difference]: With dead ends: 122 [2019-11-27 19:05:41,497 INFO L226 Difference]: Without dead ends: 122 [2019-11-27 19:05:41,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-27 19:05:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-27 19:05:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2019-11-27 19:05:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-27 19:05:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-11-27 19:05:41,504 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 26 [2019-11-27 19:05:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:41,504 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-11-27 19:05:41,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 19:05:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-11-27 19:05:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 19:05:41,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:41,506 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] [2019-11-27 19:05:41,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 19:05:41,717 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -269956851, now seen corresponding path program 1 times [2019-11-27 19:05:41,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:41,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484688244] [2019-11-27 19:05:41,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:41,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 19:05:41,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:41,812 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 19:05:41,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 19:05:41,813 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:41,818 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:41,819 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:41,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-27 19:05:41,841 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-27 19:05:41,841 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:41,860 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-27 19:05:41,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484688244] [2019-11-27 19:05:41,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:41,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 19:05:41,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107628738] [2019-11-27 19:05:41,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 19:05:41,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 19:05:41,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 19:05:41,864 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 5 states. [2019-11-27 19:05:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:42,116 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-11-27 19:05:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:05:42,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-27 19:05:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:42,118 INFO L225 Difference]: With dead ends: 100 [2019-11-27 19:05:42,118 INFO L226 Difference]: Without dead ends: 100 [2019-11-27 19:05:42,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 19:05:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-27 19:05:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-27 19:05:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-27 19:05:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2019-11-27 19:05:42,122 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 27 [2019-11-27 19:05:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:42,123 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2019-11-27 19:05:42,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 19:05:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2019-11-27 19:05:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 19:05:42,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:42,124 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] [2019-11-27 19:05:42,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 19:05:42,340 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash -269956850, now seen corresponding path program 1 times [2019-11-27 19:05:42,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:42,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304054157] [2019-11-27 19:05:42,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:42,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 19:05:42,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:42,426 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 19:05:42,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 19:05:42,427 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:42,436 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:42,437 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:42,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-27 19:05:42,474 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-27 19:05:42,475 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:42,593 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-27 19:05:42,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304054157] [2019-11-27 19:05:42,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:05:42,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-27 19:05:42,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201918409] [2019-11-27 19:05:42,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 19:05:42,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 19:05:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 19:05:42,595 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 8 states. [2019-11-27 19:05:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:43,137 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2019-11-27 19:05:43,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:05:43,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-27 19:05:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:43,140 INFO L225 Difference]: With dead ends: 95 [2019-11-27 19:05:43,140 INFO L226 Difference]: Without dead ends: 95 [2019-11-27 19:05:43,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:05:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-27 19:05:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-11-27 19:05:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-27 19:05:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2019-11-27 19:05:43,144 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 27 [2019-11-27 19:05:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:43,145 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2019-11-27 19:05:43,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 19:05:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2019-11-27 19:05:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 19:05:43,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:43,147 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] [2019-11-27 19:05:43,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 19:05:43,356 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2100210528, now seen corresponding path program 1 times [2019-11-27 19:05:43,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:43,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737858692] [2019-11-27 19:05:43,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:43,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 19:05:43,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:05:43,522 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:43,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:43,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-11-27 19:05:43,788 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:43,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-11-27 19:05:43,805 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:43,865 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:43,866 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-27 19:05:43,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:42 [2019-11-27 19:05:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:05:44,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737858692] [2019-11-27 19:05:44,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:05:44,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-27 19:05:44,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629542475] [2019-11-27 19:05:44,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 19:05:44,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:44,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 19:05:44,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-27 19:05:44,461 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand 16 states. [2019-11-27 19:05:46,600 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-11-27 19:05:47,383 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-11-27 19:05:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:05:48,343 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2019-11-27 19:05:48,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-27 19:05:48,344 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-27 19:05:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:05:48,347 INFO L225 Difference]: With dead ends: 180 [2019-11-27 19:05:48,347 INFO L226 Difference]: Without dead ends: 180 [2019-11-27 19:05:48,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 19:05:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-27 19:05:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 114. [2019-11-27 19:05:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-27 19:05:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 142 transitions. [2019-11-27 19:05:48,356 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 142 transitions. Word has length 31 [2019-11-27 19:05:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:05:48,356 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 142 transitions. [2019-11-27 19:05:48,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 19:05:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2019-11-27 19:05:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 19:05:48,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:05:48,357 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 19:05:48,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 19:05:48,565 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:05:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:05:48,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1083087694, now seen corresponding path program 1 times [2019-11-27 19:05:48,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:05:48,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780644820] [2019-11-27 19:05:48,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-27 19:05:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:05:48,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 19:05:48,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:05:48,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-27 19:05:48,674 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:48,689 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:48,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 19:05:48,694 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:48,710 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:48,711 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:05:48,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-11-27 19:05:48,894 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_114|], 2=[|v_#length_65|]} [2019-11-27 19:05:48,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:48,912 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 13 treesize of output 17 [2019-11-27 19:05:48,912 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:48,940 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:05:49,002 INFO L343 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2019-11-27 19:05:49,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 35 [2019-11-27 19:05:49,003 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:05:49,081 INFO L588 ElimStorePlain]: treesize reduction 10, result has 77.8 percent of original size [2019-11-27 19:05:49,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:49,083 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 19:05:49,083 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2019-11-27 19:05:49,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:49,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:49,260 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-11-27 19:05:49,648 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-11-27 19:05:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:05:50,070 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:05:52,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:05:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:05:53,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780644820] [2019-11-27 19:05:53,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:05:53,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-11-27 19:05:53,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797020271] [2019-11-27 19:05:53,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-27 19:05:53,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:05:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-27 19:05:53,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-27 19:05:53,373 INFO L87 Difference]: Start difference. First operand 114 states and 142 transitions. Second operand 25 states. [2019-11-27 19:05:55,184 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-27 19:05:55,740 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-11-27 19:05:56,291 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-11-27 19:05:56,718 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-11-27 19:05:57,164 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-11-27 19:05:57,992 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-11-27 19:05:59,007 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-27 19:05:59,905 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-27 19:06:00,464 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-11-27 19:06:01,175 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-27 19:06:01,626 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-27 19:06:02,979 WARN L192 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-27 19:06:03,828 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-11-27 19:06:04,366 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-27 19:06:05,397 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-27 19:06:06,652 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-27 19:06:07,146 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-27 19:06:09,218 WARN L192 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 98 DAG size of output: 97 [2019-11-27 19:06:10,017 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-27 19:06:11,459 WARN L192 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-27 19:06:12,759 WARN L192 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-11-27 19:06:14,158 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-27 19:06:15,847 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-27 19:06:16,615 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-27 19:06:17,647 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-27 19:06:18,743 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-27 19:06:19,976 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-27 19:06:20,744 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-27 19:06:21,540 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-27 19:06:22,740 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-27 19:06:23,270 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-27 19:06:23,868 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-27 19:06:24,430 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-27 19:06:26,968 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-27 19:06:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:06:27,050 INFO L93 Difference]: Finished difference Result 232 states and 277 transitions. [2019-11-27 19:06:27,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-27 19:06:27,052 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2019-11-27 19:06:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:06:27,054 INFO L225 Difference]: With dead ends: 232 [2019-11-27 19:06:27,054 INFO L226 Difference]: Without dead ends: 232 [2019-11-27 19:06:27,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=769, Invalid=3013, Unknown=0, NotChecked=0, Total=3782 [2019-11-27 19:06:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-27 19:06:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 144. [2019-11-27 19:06:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 19:06:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 185 transitions. [2019-11-27 19:06:27,071 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 185 transitions. Word has length 34 [2019-11-27 19:06:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:06:27,071 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 185 transitions. [2019-11-27 19:06:27,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-27 19:06:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 185 transitions. [2019-11-27 19:06:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 19:06:27,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:06:27,073 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 19:06:27,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 19:06:27,279 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:06:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:06:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1710485461, now seen corresponding path program 2 times [2019-11-27 19:06:27,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:06:27,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936830722] [2019-11-27 19:06:27,281 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-27 19:06:27,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 19:06:27,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 19:06:27,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 19:06:27,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:06:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:06:27,744 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:06:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:06:28,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936830722] [2019-11-27 19:06:28,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:06:28,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-11-27 19:06:28,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479963302] [2019-11-27 19:06:28,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 19:06:28,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:06:28,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 19:06:28,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-11-27 19:06:28,248 INFO L87 Difference]: Start difference. First operand 144 states and 185 transitions. Second operand 18 states. [2019-11-27 19:06:29,780 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-27 19:06:29,963 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-27 19:06:30,883 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-27 19:06:32,539 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-27 19:06:32,727 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-27 19:06:33,039 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-27 19:06:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:06:33,399 INFO L93 Difference]: Finished difference Result 281 states and 358 transitions. [2019-11-27 19:06:33,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-27 19:06:33,400 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-11-27 19:06:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:06:33,402 INFO L225 Difference]: With dead ends: 281 [2019-11-27 19:06:33,402 INFO L226 Difference]: Without dead ends: 281 [2019-11-27 19:06:33,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=382, Invalid=1598, Unknown=0, NotChecked=0, Total=1980 [2019-11-27 19:06:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-27 19:06:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2019-11-27 19:06:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-27 19:06:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-11-27 19:06:33,412 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 34 [2019-11-27 19:06:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:06:33,412 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-11-27 19:06:33,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 19:06:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-11-27 19:06:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 19:06:33,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:06:33,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:06:33,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 19:06:33,625 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:06:33,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:06:33,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1149138921, now seen corresponding path program 1 times [2019-11-27 19:06:33,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:06:33,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122738726] [2019-11-27 19:06:33,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-27 19:06:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:06:33,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 19:06:33,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:06:33,742 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-27 19:06:33,743 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:06:33,817 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-27 19:06:33,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122738726] [2019-11-27 19:06:33,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:06:33,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-27 19:06:33,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362764227] [2019-11-27 19:06:33,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 19:06:33,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:06:33,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 19:06:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-27 19:06:33,818 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 12 states. [2019-11-27 19:06:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:06:33,873 INFO L93 Difference]: Finished difference Result 228 states and 296 transitions. [2019-11-27 19:06:33,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 19:06:33,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-27 19:06:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:06:33,876 INFO L225 Difference]: With dead ends: 228 [2019-11-27 19:06:33,876 INFO L226 Difference]: Without dead ends: 228 [2019-11-27 19:06:33,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-27 19:06:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-27 19:06:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 197. [2019-11-27 19:06:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-27 19:06:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2019-11-27 19:06:33,885 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 35 [2019-11-27 19:06:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:06:33,886 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2019-11-27 19:06:33,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 19:06:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2019-11-27 19:06:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 19:06:33,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:06:33,887 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] [2019-11-27 19:06:34,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 19:06:34,099 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:06:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:06:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -909618494, now seen corresponding path program 1 times [2019-11-27 19:06:34,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:06:34,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151216944] [2019-11-27 19:06:34,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-27 19:06:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:06:34,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-27 19:06:34,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:06:34,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-27 19:06:34,220 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:06:34,232 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:06:34,233 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:06:34,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-27 19:06:36,711 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 15 treesize of output 11 [2019-11-27 19:06:36,711 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:06:36,796 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:06:36,797 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 19:06:36,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:57 [2019-11-27 19:06:37,027 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-27 19:06:37,069 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-27 19:06:37,070 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 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-27 19:06:37,070 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:06:37,136 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:06:37,137 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 19:06:37,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:59 [2019-11-27 19:06:39,981 WARN L192 SmtUtils]: Spent 738.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-27 19:06:40,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:06:40,008 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 25 treesize of output 27 [2019-11-27 19:06:40,009 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:06:40,161 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-27 19:06:40,161 INFO L588 ElimStorePlain]: treesize reduction 13, result has 82.2 percent of original size [2019-11-27 19:06:40,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:06:40,163 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 19:06:40,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:75, output treesize:42 [2019-11-27 19:06:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 19:06:50,853 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:07:19,372 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-27 19:07:19,564 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-27 19:07:19,671 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-27 19:07:19,684 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 41 treesize of output 37 [2019-11-27 19:07:19,697 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 19:07:19,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 19:07:19,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 243 [2019-11-27 19:07:19,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:19,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:20,205 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-27 19:07:20,432 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 16 [2019-11-27 19:07:20,433 INFO L588 ElimStorePlain]: treesize reduction 17299, result has 0.2 percent of original size [2019-11-27 19:07:20,433 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-27 19:07:20,439 INFO L588 ElimStorePlain]: treesize reduction 72, result has 1.4 percent of original size [2019-11-27 19:07:20,440 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:07:20,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:1 [2019-11-27 19:07:26,821 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-27 19:07:26,821 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 385 treesize of output 345 [2019-11-27 19:07:26,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:26,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:07:27,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:27,607 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-27 19:07:28,557 WARN L192 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-11-27 19:07:28,558 INFO L588 ElimStorePlain]: treesize reduction 2828, result has 2.1 percent of original size [2019-11-27 19:07:28,558 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:07:28,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2019-11-27 19:07:30,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:07:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 19:07:30,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151216944] [2019-11-27 19:07:30,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:07:30,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-11-27 19:07:30,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021119757] [2019-11-27 19:07:30,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-27 19:07:30,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:07:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-27 19:07:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=847, Unknown=16, NotChecked=0, Total=992 [2019-11-27 19:07:30,961 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand 32 states. [2019-11-27 19:07:39,945 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-27 19:07:58,661 WARN L192 SmtUtils]: Spent 12.64 s on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-27 19:08:13,775 WARN L192 SmtUtils]: Spent 12.63 s on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-11-27 19:08:24,459 WARN L192 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-11-27 19:09:17,689 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-27 19:10:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:10:17,782 INFO L93 Difference]: Finished difference Result 236 states and 302 transitions. [2019-11-27 19:10:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-27 19:10:17,783 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-27 19:10:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:10:17,785 INFO L225 Difference]: With dead ends: 236 [2019-11-27 19:10:17,785 INFO L226 Difference]: Without dead ends: 228 [2019-11-27 19:10:17,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 130.1s TimeCoverageRelationStatistics Valid=367, Invalid=2363, Unknown=26, NotChecked=0, Total=2756 [2019-11-27 19:10:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-27 19:10:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 192. [2019-11-27 19:10:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-27 19:10:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 254 transitions. [2019-11-27 19:10:17,793 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 254 transitions. Word has length 40 [2019-11-27 19:10:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:10:17,794 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 254 transitions. [2019-11-27 19:10:17,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-27 19:10:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 254 transitions. [2019-11-27 19:10:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 19:10:17,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:10:17,795 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] [2019-11-27 19:10:18,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 19:10:18,002 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:10:18,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:10:18,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1501012420, now seen corresponding path program 2 times [2019-11-27 19:10:18,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:10:18,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928427959] [2019-11-27 19:10:18,004 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-27 19:10:18,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 19:10:18,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 19:10:18,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 19:10:18,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:10:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-27 19:10:18,248 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:10:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-27 19:10:18,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928427959] [2019-11-27 19:10:18,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:10:18,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-27 19:10:18,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692223439] [2019-11-27 19:10:18,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 19:10:18,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:10:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 19:10:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 19:10:18,495 INFO L87 Difference]: Start difference. First operand 192 states and 254 transitions. Second operand 12 states. [2019-11-27 19:10:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:10:18,800 INFO L93 Difference]: Finished difference Result 214 states and 276 transitions. [2019-11-27 19:10:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:10:18,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-11-27 19:10:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:10:18,803 INFO L225 Difference]: With dead ends: 214 [2019-11-27 19:10:18,803 INFO L226 Difference]: Without dead ends: 211 [2019-11-27 19:10:18,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-27 19:10:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-27 19:10:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2019-11-27 19:10:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-27 19:10:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2019-11-27 19:10:18,812 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 42 [2019-11-27 19:10:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:10:18,812 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2019-11-27 19:10:18,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 19:10:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2019-11-27 19:10:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 19:10:18,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:10:18,813 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:10:19,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 19:10:19,015 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:10:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:10:19,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1547438402, now seen corresponding path program 1 times [2019-11-27 19:10:19,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:10:19,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824246731] [2019-11-27 19:10:19,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-27 19:10:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:10:19,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-27 19:10:19,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:10:19,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 19:10:19,117 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,118 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:19,118 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-11-27 19:10:19,142 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 11 treesize of output 7 [2019-11-27 19:10:19,142 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,149 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:19,150 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-27 19:10:19,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:19,196 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 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-27 19:10:19,196 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,237 INFO L588 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-27 19:10:19,238 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-27 19:10:19,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:11 [2019-11-27 19:10:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:19,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 19:10:19,320 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,327 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:19,327 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-27 19:10:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:10:19,355 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:10:19,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:19,628 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,651 INFO L588 ElimStorePlain]: treesize reduction 7, result has 63.2 percent of original size [2019-11-27 19:10:19,652 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-11-27 19:10:19,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2019-11-27 19:10:19,746 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,836 INFO L588 ElimStorePlain]: treesize reduction 21, result has 61.1 percent of original size [2019-11-27 19:10:19,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 19:10:19,838 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:19,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:18 [2019-11-27 19:10:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:10:19,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824246731] [2019-11-27 19:10:19,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:10:19,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 15 [2019-11-27 19:10:19,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915057711] [2019-11-27 19:10:19,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 19:10:19,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:10:19,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 19:10:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-27 19:10:19,891 INFO L87 Difference]: Start difference. First operand 192 states and 252 transitions. Second operand 15 states. [2019-11-27 19:10:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:10:29,373 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2019-11-27 19:10:29,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 19:10:29,376 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-11-27 19:10:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:10:29,377 INFO L225 Difference]: With dead ends: 285 [2019-11-27 19:10:29,378 INFO L226 Difference]: Without dead ends: 285 [2019-11-27 19:10:29,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-11-27 19:10:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-27 19:10:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 245. [2019-11-27 19:10:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-27 19:10:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 316 transitions. [2019-11-27 19:10:29,386 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 316 transitions. Word has length 43 [2019-11-27 19:10:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:10:29,387 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 316 transitions. [2019-11-27 19:10:29,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 19:10:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 316 transitions. [2019-11-27 19:10:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 19:10:29,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:10:29,388 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:10:29,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 19:10:29,593 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:10:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:10:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1871293516, now seen corresponding path program 1 times [2019-11-27 19:10:29,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:10:29,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790101122] [2019-11-27 19:10:29,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-27 19:10:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:10:29,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 19:10:29,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:10:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:10:30,011 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:10:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:10:30,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790101122] [2019-11-27 19:10:30,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:10:30,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-11-27 19:10:30,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263067708] [2019-11-27 19:10:30,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 19:10:30,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:10:30,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 19:10:30,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-11-27 19:10:30,737 INFO L87 Difference]: Start difference. First operand 245 states and 316 transitions. Second operand 23 states. [2019-11-27 19:10:34,333 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-11-27 19:10:34,641 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-11-27 19:10:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:10:34,952 INFO L93 Difference]: Finished difference Result 376 states and 471 transitions. [2019-11-27 19:10:34,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-27 19:10:34,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-11-27 19:10:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:10:34,956 INFO L225 Difference]: With dead ends: 376 [2019-11-27 19:10:34,956 INFO L226 Difference]: Without dead ends: 376 [2019-11-27 19:10:34,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=549, Invalid=2313, Unknown=0, NotChecked=0, Total=2862 [2019-11-27 19:10:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-27 19:10:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 276. [2019-11-27 19:10:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-27 19:10:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 367 transitions. [2019-11-27 19:10:34,968 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 367 transitions. Word has length 42 [2019-11-27 19:10:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:10:34,969 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 367 transitions. [2019-11-27 19:10:34,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 19:10:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 367 transitions. [2019-11-27 19:10:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 19:10:34,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:10:34,970 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 19:10:35,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 19:10:35,191 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:10:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:10:35,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1715645055, now seen corresponding path program 1 times [2019-11-27 19:10:35,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:10:35,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921014155] [2019-11-27 19:10:35,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-27 19:10:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:10:35,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-27 19:10:35,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:10:35,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 19:10:35,312 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:35,320 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:35,320 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:35,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-27 19:10:35,464 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-27 19:10:35,465 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:35,481 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:35,481 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:35,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-27 19:10:35,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:35,542 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 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-27 19:10:35,542 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:35,584 INFO L588 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-27 19:10:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:35,585 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:10:35,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-11-27 19:10:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:35,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:35,857 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 24 treesize of output 12 [2019-11-27 19:10:35,857 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:35,869 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:35,869 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:35,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:10 [2019-11-27 19:10:35,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:10:36,067 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:10:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:36,529 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-11-27 19:10:36,754 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-27 19:10:36,910 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-27 19:10:36,917 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:10:36,928 INFO L588 ElimStorePlain]: treesize reduction 27, result has 3.6 percent of original size [2019-11-27 19:10:36,928 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:10:36,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:1 [2019-11-27 19:10:37,179 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 70 treesize of output 66 [2019-11-27 19:10:37,179 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:10:37,267 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:37,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:37,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:10:37,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:37,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:10:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:10:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:10:37,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:37,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:10:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:37,272 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-11-27 19:10:37,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:214 [2019-11-27 19:10:37,561 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2019-11-27 19:10:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:10:37,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921014155] [2019-11-27 19:10:37,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 19:10:37,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2019-11-27 19:10:37,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129393843] [2019-11-27 19:10:37,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 19:10:37,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:10:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 19:10:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=486, Unknown=1, NotChecked=0, Total=552 [2019-11-27 19:10:37,805 INFO L87 Difference]: Start difference. First operand 276 states and 367 transitions. Second operand 12 states. [2019-11-27 19:10:38,073 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-27 19:10:38,280 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-11-27 19:10:38,673 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-27 19:10:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:10:39,586 INFO L93 Difference]: Finished difference Result 317 states and 412 transitions. [2019-11-27 19:10:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 19:10:39,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-27 19:10:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:10:39,589 INFO L225 Difference]: With dead ends: 317 [2019-11-27 19:10:39,589 INFO L226 Difference]: Without dead ends: 317 [2019-11-27 19:10:39,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=101, Invalid=768, Unknown=1, NotChecked=0, Total=870 [2019-11-27 19:10:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-27 19:10:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 293. [2019-11-27 19:10:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-27 19:10:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 385 transitions. [2019-11-27 19:10:39,600 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 385 transitions. Word has length 45 [2019-11-27 19:10:39,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:10:39,600 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 385 transitions. [2019-11-27 19:10:39,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 19:10:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 385 transitions. [2019-11-27 19:10:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 19:10:39,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:10:39,602 INFO L410 BasicCegarLoop]: trace histogram [4, 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] [2019-11-27 19:10:39,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-27 19:10:39,813 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:10:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:10:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash 670264949, now seen corresponding path program 3 times [2019-11-27 19:10:39,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:10:39,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771751881] [2019-11-27 19:10:39,816 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-27 19:10:39,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 19:10:39,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 19:10:39,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 19:10:39,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:10:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-27 19:10:40,062 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:10:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-27 19:10:40,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771751881] [2019-11-27 19:10:40,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 19:10:40,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-11-27 19:10:40,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817289477] [2019-11-27 19:10:40,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 19:10:40,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:10:40,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 19:10:40,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 19:10:40,141 INFO L87 Difference]: Start difference. First operand 293 states and 385 transitions. Second operand 5 states. [2019-11-27 19:10:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:10:40,284 INFO L93 Difference]: Finished difference Result 285 states and 364 transitions. [2019-11-27 19:10:40,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:10:40,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-27 19:10:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:10:40,288 INFO L225 Difference]: With dead ends: 285 [2019-11-27 19:10:40,288 INFO L226 Difference]: Without dead ends: 285 [2019-11-27 19:10:40,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 19:10:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-27 19:10:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2019-11-27 19:10:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-27 19:10:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 358 transitions. [2019-11-27 19:10:40,298 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 358 transitions. Word has length 44 [2019-11-27 19:10:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:10:40,299 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 358 transitions. [2019-11-27 19:10:40,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 19:10:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 358 transitions. [2019-11-27 19:10:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 19:10:40,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:10:40,300 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 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-27 19:10:40,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-27 19:10:40,520 INFO L410 AbstractCegarLoop]: === Iteration 22 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:10:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:10:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2060287677, now seen corresponding path program 2 times [2019-11-27 19:10:40,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:10:40,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104247828] [2019-11-27 19:10:40,521 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-27 19:10:40,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 19:10:40,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 19:10:40,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-27 19:10:40,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:10:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:10:40,852 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:10:41,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:10:41,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-11-27 19:10:41,440 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:10:41,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-11-27 19:10:41,453 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:10:41,516 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:10:41,517 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-27 19:10:41,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:42 [2019-11-27 19:10:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:10:42,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104247828] [2019-11-27 19:10:42,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:10:42,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-27 19:10:42,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340581022] [2019-11-27 19:10:42,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-27 19:10:42,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:10:42,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-27 19:10:42,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-11-27 19:10:42,879 INFO L87 Difference]: Start difference. First operand 279 states and 358 transitions. Second operand 24 states. [2019-11-27 19:10:45,087 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-27 19:10:45,593 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-27 19:10:46,014 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-27 19:10:46,388 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-11-27 19:10:47,250 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-27 19:10:48,107 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-11-27 19:10:49,767 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-11-27 19:10:50,782 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-27 19:10:51,441 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-11-27 19:10:52,299 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-27 19:10:53,295 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-27 19:10:54,258 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-27 19:10:56,663 WARN L192 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-27 19:10:57,466 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-27 19:10:58,118 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-27 19:10:59,261 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-27 19:11:02,554 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-27 19:11:03,369 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-27 19:11:03,876 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-11-27 19:11:04,551 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-11-27 19:11:05,349 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-11-27 19:11:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:11:06,861 INFO L93 Difference]: Finished difference Result 500 states and 599 transitions. [2019-11-27 19:11:06,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-11-27 19:11:06,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2019-11-27 19:11:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:11:06,866 INFO L225 Difference]: With dead ends: 500 [2019-11-27 19:11:06,866 INFO L226 Difference]: Without dead ends: 500 [2019-11-27 19:11:06,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=950, Invalid=5212, Unknown=0, NotChecked=0, Total=6162 [2019-11-27 19:11:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-27 19:11:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 285. [2019-11-27 19:11:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-27 19:11:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2019-11-27 19:11:06,879 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 47 [2019-11-27 19:11:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:11:06,880 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2019-11-27 19:11:06,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-27 19:11:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2019-11-27 19:11:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 19:11:06,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:11:06,881 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:11:07,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-27 19:11:07,093 INFO L410 AbstractCegarLoop]: === Iteration 23 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:11:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:11:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1338570350, now seen corresponding path program 1 times [2019-11-27 19:11:07,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:11:07,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960595766] [2019-11-27 19:11:07,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-27 19:11:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:11:07,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-27 19:11:07,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:11:07,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 19:11:07,223 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:07,233 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:07,233 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:11:07,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-27 19:11:07,405 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-27 19:11:07,406 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:07,421 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:07,422 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:11:07,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-27 19:11:07,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:07,485 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 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-27 19:11:07,486 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:07,528 INFO L588 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-27 19:11:07,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:07,529 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:11:07,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-11-27 19:11:07,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:07,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:07,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:07,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:07,778 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 24 treesize of output 12 [2019-11-27 19:11:07,778 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:07,789 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:07,790 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:11:07,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:10 [2019-11-27 19:11:07,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:11:07,898 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:11:07,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:08,373 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:08,381 INFO L588 ElimStorePlain]: treesize reduction 27, result has 3.6 percent of original size [2019-11-27 19:11:08,381 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:11:08,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:1 [2019-11-27 19:11:08,545 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 70 treesize of output 66 [2019-11-27 19:11:08,546 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 19:11:08,635 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:08,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:08,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:08,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:08,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:08,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:08,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:08,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:08,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:08,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:08,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:08,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:08,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:08,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:08,641 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 4 xjuncts. [2019-11-27 19:11:08,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:264 [2019-11-27 19:11:09,020 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 17 [2019-11-27 19:11:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:11:09,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960595766] [2019-11-27 19:11:09,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 19:11:09,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2019-11-27 19:11:09,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138032644] [2019-11-27 19:11:09,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-27 19:11:09,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 19:11:09,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-27 19:11:09,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2019-11-27 19:11:09,373 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand 26 states. [2019-11-27 19:11:11,984 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-27 19:11:14,634 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-27 19:11:15,733 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-11-27 19:11:16,427 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-27 19:11:17,108 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-11-27 19:11:17,903 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-27 19:11:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:11:19,501 INFO L93 Difference]: Finished difference Result 391 states and 475 transitions. [2019-11-27 19:11:19,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-27 19:11:19,501 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-11-27 19:11:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:11:19,504 INFO L225 Difference]: With dead ends: 391 [2019-11-27 19:11:19,504 INFO L226 Difference]: Without dead ends: 391 [2019-11-27 19:11:19,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=338, Invalid=2211, Unknown=1, NotChecked=0, Total=2550 [2019-11-27 19:11:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-27 19:11:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 289. [2019-11-27 19:11:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-27 19:11:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 368 transitions. [2019-11-27 19:11:19,514 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 368 transitions. Word has length 50 [2019-11-27 19:11:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:11:19,514 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 368 transitions. [2019-11-27 19:11:19,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-27 19:11:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 368 transitions. [2019-11-27 19:11:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 19:11:19,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:11:19,516 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 19:11:19,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-27 19:11:19,728 INFO L410 AbstractCegarLoop]: === Iteration 24 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-27 19:11:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:11:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash 831936866, now seen corresponding path program 3 times [2019-11-27 19:11:19,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 19:11:19,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932321442] [2019-11-27 19:11:19,729 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-27 19:11:19,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 19:11:19,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 19:11:19,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-27 19:11:19,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 19:11:19,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-27 19:11:19,889 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:19,909 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:19,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 19:11:19,914 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:19,934 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:19,934 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 19:11:19,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-11-27 19:11:20,167 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 15 treesize of output 11 [2019-11-27 19:11:20,167 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:20,287 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-27 19:11:20,288 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:20,289 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 19:11:20,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:55 [2019-11-27 19:11:20,406 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-27 19:11:20,407 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 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-27 19:11:20,407 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:20,487 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:20,488 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 19:11:20,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:57 [2019-11-27 19:11:20,869 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-27 19:11:20,872 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_159|], 2=[|v_#length_77|]} [2019-11-27 19:11:20,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:20,896 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 13 treesize of output 17 [2019-11-27 19:11:20,896 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:21,022 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-27 19:11:21,023 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:21,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:11:21,057 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 19:11:21,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-27 19:11:21,058 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:21,223 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-27 19:11:21,224 INFO L588 ElimStorePlain]: treesize reduction 4, result has 94.2 percent of original size [2019-11-27 19:11:21,224 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-27 19:11:21,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:76, output treesize:65 [2019-11-27 19:11:21,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 19:11:21,365 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 15 treesize of output 3 [2019-11-27 19:11:21,366 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 19:11:21,416 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:21,417 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-27 19:11:21,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:58, output treesize:43 [2019-11-27 19:11:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-27 19:11:23,079 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 19:11:23,201 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-27 19:11:23,392 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-27 19:11:23,502 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-27 19:11:25,926 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-27 19:11:25,928 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:26,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,504 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-27 19:11:27,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,509 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,513 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,519 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,522 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,526 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,529 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,532 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:27,535 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-27 19:11:28,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 43 treesize of output 39 [2019-11-27 19:11:28,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:28,726 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 335 treesize of output 315 [2019-11-27 19:11:28,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:28,922 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-27 19:11:29,311 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 24 [2019-11-27 19:11:29,312 INFO L588 ElimStorePlain]: treesize reduction 7385, result has 1.0 percent of original size [2019-11-27 19:11:29,312 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-27 19:11:29,575 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-27 19:11:29,575 INFO L588 ElimStorePlain]: treesize reduction 49, result has 63.4 percent of original size [2019-11-27 19:11:29,576 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-27 19:11:29,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:85 [2019-11-27 19:11:29,972 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2019-11-27 19:11:37,171 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-27 19:11:48,439 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 77 [2019-11-27 19:11:49,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 19:11:49,701 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 453 treesize of output 417 [2019-11-27 19:11:49,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 19:11:49,858 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 10 xjuncts. [2019-11-27 19:11:59,202 WARN L192 SmtUtils]: Spent 9.34 s on a formula simplification. DAG size of input: 164 DAG size of output: 81 [2019-11-27 19:11:59,203 INFO L588 ElimStorePlain]: treesize reduction 60638, result has 0.3 percent of original size [2019-11-27 19:11:59,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:59,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:59,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:59,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 19:11:59,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-27 19:11:59,407 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (exists ((v_mkdup_~j~0_73 (_ BitVec 32)) (|v_main_~#i~2.base_35| (_ BitVec 32)) (|v_main_~#j~2.base_35| (_ BitVec 32)) (v_finddup_~j~1_116 (_ BitVec 32)) (v_mkdup_~i~0_73 (_ BitVec 32))) (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse7 (bvmul v_prenex_42 (_ bv4 32)))) (let ((.cse0 (bvadd |mkdup_#in~a.offset| .cse7 (_ bv4 32))) (.cse3 (bvadd |mkdup_#in~a.offset| .cse7))) (or (not (bvule .cse0 (select (store (store |#length| v_prenex_40 (_ bv4 32)) v_prenex_41 (_ bv4 32)) |mkdup_#in~a.base|))) (let ((.cse1 (bvmul v_finddup_~j~1_116 (_ bv4 32)))) (let ((.cse2 (bvadd |mkdup_#in~a.offset| .cse1 (_ bv4 32)))) (and (bvule (bvadd |mkdup_#in~a.offset| .cse1) .cse2) (bvult |#StackHeapBarrier| |v_main_~#j~2.base_35|) (not (= (bvmul v_mkdup_~j~0_73 (_ bv4 32)) .cse1)) (bvule .cse2 (select (store (store |#length| |v_main_~#i~2.base_35| (_ bv4 32)) |v_main_~#j~2.base_35| (_ bv4 32)) |mkdup_#in~a.base|)) (= (select |#valid| |v_main_~#i~2.base_35|) (_ bv0 1)) (bvsle (_ bv0 32) v_mkdup_~j~0_73) (bvslt v_mkdup_~i~0_73 |mkdup_#in~n|) (not (= .cse1 (bvmul v_mkdup_~i~0_73 (_ bv4 32)))) (not (= v_mkdup_~j~0_73 v_mkdup_~i~0_73)) (bvsle (_ bv0 32) v_mkdup_~i~0_73) (bvslt v_mkdup_~j~0_73 |mkdup_#in~n|)))) (not (bvule .cse3 .cse0)) (let ((.cse4 (bvadd (bvmul mkdup_~i~0 (_ bv4 32)) mkdup_~a.offset)) (.cse5 (bvadd (bvmul mkdup_~j~0 (_ bv4 32)) mkdup_~a.offset))) (and (or (= .cse4 |mkdup_#in~a.offset|) (= .cse5 |mkdup_#in~a.offset|)) (let ((.cse6 (= |mkdup_#in~a.base| mkdup_~a.base))) (or (and (= .cse4 .cse3) .cse6) (and (= .cse5 .cse3) .cse6))))) (= |mkdup_#in~a.offset| .cse3) (bvslt (_ bv2 32) |mkdup_#in~n|) (not (= (select |#valid| v_prenex_40) (_ bv0 1))) (not (bvult |#StackHeapBarrier| v_prenex_41))))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:505) 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.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) 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.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-27 19:11:59,414 INFO L168 Benchmark]: Toolchain (without parser) took 458728.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 952.3 MB in the beginning and 940.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:59,415 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 19:11:59,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:59,416 INFO L168 Benchmark]: Boogie Preprocessor took 54.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:59,416 INFO L168 Benchmark]: RCFGBuilder took 768.38 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:59,416 INFO L168 Benchmark]: TraceAbstraction took 457517.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 29.4 MB). Free memory was 1.1 GB in the beginning and 940.9 MB in the end (delta: 151.2 MB). Peak memory consumption was 316.0 MB. Max. memory is 11.5 GB. [2019-11-27 19:11:59,418 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 768.38 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 457517.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 29.4 MB). Free memory was 1.1 GB in the beginning and 940.9 MB in the end (delta: 151.2 MB). Peak memory consumption was 316.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (exists ((v_mkdup_~j~0_73 (_ BitVec 32)) (|v_main_~#i~2.base_35| (_ BitVec 32)) (|v_main_~#j~2.base_35| (_ BitVec 32)) (v_finddup_~j~1_116 (_ BitVec 32)) (v_mkdup_~i~0_73 (_ BitVec 32))) (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse7 (bvmul v_prenex_42 (_ bv4 32)))) (let ((.cse0 (bvadd |mkdup_#in~a.offset| .cse7 (_ bv4 32))) (.cse3 (bvadd |mkdup_#in~a.offset| .cse7))) (or (not (bvule .cse0 (select (store (store |#length| v_prenex_40 (_ bv4 32)) v_prenex_41 (_ bv4 32)) |mkdup_#in~a.base|))) (let ((.cse1 (bvmul v_finddup_~j~1_116 (_ bv4 32)))) (let ((.cse2 (bvadd |mkdup_#in~a.offset| .cse1 (_ bv4 32)))) (and (bvule (bvadd |mkdup_#in~a.offset| .cse1) .cse2) (bvult |#StackHeapBarrier| |v_main_~#j~2.base_35|) (not (= (bvmul v_mkdup_~j~0_73 (_ bv4 32)) .cse1)) (bvule .cse2 (select (store (store |#length| |v_main_~#i~2.base_35| (_ bv4 32)) |v_main_~#j~2.base_35| (_ bv4 32)) |mkdup_#in~a.base|)) (= (select |#valid| |v_main_~#i~2.base_35|) (_ bv0 1)) (bvsle (_ bv0 32) v_mkdup_~j~0_73) (bvslt v_mkdup_~i~0_73 |mkdup_#in~n|) (not (= .cse1 (bvmul v_mkdup_~i~0_73 (_ bv4 32)))) (not (= v_mkdup_~j~0_73 v_mkdup_~i~0_73)) (bvsle (_ bv0 32) v_mkdup_~i~0_73) (bvslt v_mkdup_~j~0_73 |mkdup_#in~n|)))) (not (bvule .cse3 .cse0)) (let ((.cse4 (bvadd (bvmul mkdup_~i~0 (_ bv4 32)) mkdup_~a.offset)) (.cse5 (bvadd (bvmul mkdup_~j~0 (_ bv4 32)) mkdup_~a.offset))) (and (or (= .cse4 |mkdup_#in~a.offset|) (= .cse5 |mkdup_#in~a.offset|)) (let ((.cse6 (= |mkdup_#in~a.base| mkdup_~a.base))) (or (and (= .cse4 .cse3) .cse6) (and (= .cse5 .cse3) .cse6))))) (= |mkdup_#in~a.offset| .cse3) (bvslt (_ bv2 32) |mkdup_#in~n|) (not (= (select |#valid| v_prenex_40) (_ bv0 1))) (not (bvult |#StackHeapBarrier| v_prenex_41))))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (exists ((v_mkdup_~j~0_73 (_ BitVec 32)) (|v_main_~#i~2.base_35| (_ BitVec 32)) (|v_main_~#j~2.base_35| (_ BitVec 32)) (v_finddup_~j~1_116 (_ BitVec 32)) (v_mkdup_~i~0_73 (_ BitVec 32))) (forall ((v_prenex_40 (_ BitVec 32)) (v_prenex_41 (_ BitVec 32)) (v_prenex_42 (_ BitVec 32))) (let ((.cse7 (bvmul v_prenex_42 (_ bv4 32)))) (let ((.cse0 (bvadd |mkdup_#in~a.offset| .cse7 (_ bv4 32))) (.cse3 (bvadd |mkdup_#in~a.offset| .cse7))) (or (not (bvule .cse0 (select (store (store |#length| v_prenex_40 (_ bv4 32)) v_prenex_41 (_ bv4 32)) |mkdup_#in~a.base|))) (let ((.cse1 (bvmul v_finddup_~j~1_116 (_ bv4 32)))) (let ((.cse2 (bvadd |mkdup_#in~a.offset| .cse1 (_ bv4 32)))) (and (bvule (bvadd |mkdup_#in~a.offset| .cse1) .cse2) (bvult |#StackHeapBarrier| |v_main_~#j~2.base_35|) (not (= (bvmul v_mkdup_~j~0_73 (_ bv4 32)) .cse1)) (bvule .cse2 (select (store (store |#length| |v_main_~#i~2.base_35| (_ bv4 32)) |v_main_~#j~2.base_35| (_ bv4 32)) |mkdup_#in~a.base|)) (= (select |#valid| |v_main_~#i~2.base_35|) (_ bv0 1)) (bvsle (_ bv0 32) v_mkdup_~j~0_73) (bvslt v_mkdup_~i~0_73 |mkdup_#in~n|) (not (= .cse1 (bvmul v_mkdup_~i~0_73 (_ bv4 32)))) (not (= v_mkdup_~j~0_73 v_mkdup_~i~0_73)) (bvsle (_ bv0 32) v_mkdup_~i~0_73) (bvslt v_mkdup_~j~0_73 |mkdup_#in~n|)))) (not (bvule .cse3 .cse0)) (let ((.cse4 (bvadd (bvmul mkdup_~i~0 (_ bv4 32)) mkdup_~a.offset)) (.cse5 (bvadd (bvmul mkdup_~j~0 (_ bv4 32)) mkdup_~a.offset))) (and (or (= .cse4 |mkdup_#in~a.offset|) (= .cse5 |mkdup_#in~a.offset|)) (let ((.cse6 (= |mkdup_#in~a.base| mkdup_~a.base))) (or (and (= .cse4 .cse3) .cse6) (and (= .cse5 .cse3) .cse6))))) (= |mkdup_#in~a.offset| .cse3) (bvslt (_ bv2 32) |mkdup_#in~n|) (not (= (select |#valid| v_prenex_40) (_ bv0 1))) (not (bvult |#StackHeapBarrier| v_prenex_41))))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) 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...