./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27142e71f3089c5c3b5bf4f358882e993f701ffc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:50:27,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:50:27,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:50:27,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:50:27,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:50:27,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:50:27,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:50:27,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:50:27,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:50:27,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:50:27,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:50:27,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:50:27,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:50:27,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:50:27,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:50:27,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:50:27,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:50:27,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:50:27,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:50:28,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:50:28,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:50:28,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:50:28,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:50:28,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:50:28,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:50:28,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:50:28,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:50:28,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:50:28,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:50:28,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:50:28,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:50:28,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:50:28,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:50:28,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:50:28,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:50:28,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:50:28,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:50:28,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:50:28,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:50:28,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:50:28,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:50:28,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:50:28,051 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:50:28,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:50:28,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:50:28,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:50:28,054 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:50:28,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:50:28,054 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:50:28,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:50:28,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:50:28,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:50:28,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:50:28,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:50:28,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:50:28,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:50:28,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:50:28,057 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:50:28,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:50:28,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:50:28,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:50:28,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:50:28,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:50:28,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:50:28,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:50:28,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:50:28,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:50:28,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:50:28,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:50:28,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:50:28,060 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27142e71f3089c5c3b5bf4f358882e993f701ffc [2019-11-19 18:50:28,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:50:28,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:50:28,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:50:28,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:50:28,370 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:50:28,371 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-19 18:50:28,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab229c3e/6426b62e30f241329d66171e276ec5c7/FLAG3b6a92b45 [2019-11-19 18:50:28,997 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:50:28,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-19 18:50:29,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab229c3e/6426b62e30f241329d66171e276ec5c7/FLAG3b6a92b45 [2019-11-19 18:50:29,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab229c3e/6426b62e30f241329d66171e276ec5c7 [2019-11-19 18:50:29,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:50:29,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:50:29,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:50:29,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:50:29,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:50:29,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:29,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c67111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29, skipping insertion in model container [2019-11-19 18:50:29,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:29,316 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:50:29,369 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:50:29,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:50:29,790 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:50:29,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:50:29,907 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:50:29,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29 WrapperNode [2019-11-19 18:50:29,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:50:29,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:50:29,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:50:29,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:50:29,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:29,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:29,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:50:29,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:50:29,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:50:29,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:50:29,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:29,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:29,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:29,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:29,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:30,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:30,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (1/1) ... [2019-11-19 18:50:30,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:50:30,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:50:30,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:50:30,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:50:30,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (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-19 18:50:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 18:50:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:50:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 18:50:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 18:50:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 18:50:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-19 18:50:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:50:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:50:30,538 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:50:30,539 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-19 18:50:30,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:30 BoogieIcfgContainer [2019-11-19 18:50:30,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:50:30,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:50:30,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:50:30,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:50:30,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:50:29" (1/3) ... [2019-11-19 18:50:30,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0f98a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:50:30, skipping insertion in model container [2019-11-19 18:50:30,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:29" (2/3) ... [2019-11-19 18:50:30,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0f98a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:50:30, skipping insertion in model container [2019-11-19 18:50:30,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:30" (3/3) ... [2019-11-19 18:50:30,549 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2019-11-19 18:50:30,559 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:50:30,567 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:50:30,575 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:50:30,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:50:30,596 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:50:30,596 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:50:30,596 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:50:30,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:50:30,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:50:30,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:50:30,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:50:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-19 18:50:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 18:50:30,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:30,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:50:30,618 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:30,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1240059524, now seen corresponding path program 1 times [2019-11-19 18:50:30,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:30,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049152067] [2019-11-19 18:50:30,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:30,757 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-19 18:50:30,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049152067] [2019-11-19 18:50:30,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:50:30,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:50:30,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171823213] [2019-11-19 18:50:30,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:50:30,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:50:30,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:50:30,784 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-19 18:50:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:30,808 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2019-11-19 18:50:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:50:30,809 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-19 18:50:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:30,820 INFO L225 Difference]: With dead ends: 89 [2019-11-19 18:50:30,820 INFO L226 Difference]: Without dead ends: 40 [2019-11-19 18:50:30,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:50:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-19 18:50:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-19 18:50:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 18:50:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-11-19 18:50:30,863 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-11-19 18:50:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:30,863 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-19 18:50:30,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:50:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-11-19 18:50:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 18:50:30,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:30,865 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] [2019-11-19 18:50:30,865 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:30,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1466688541, now seen corresponding path program 1 times [2019-11-19 18:50:30,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:30,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785551224] [2019-11-19 18:50:30,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:31,007 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-19 18:50:31,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785551224] [2019-11-19 18:50:31,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:50:31,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 18:50:31,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336389475] [2019-11-19 18:50:31,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 18:50:31,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:31,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 18:50:31,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 18:50:31,016 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-11-19 18:50:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:31,144 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2019-11-19 18:50:31,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:50:31,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-19 18:50:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:31,146 INFO L225 Difference]: With dead ends: 82 [2019-11-19 18:50:31,146 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 18:50:31,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-19 18:50:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 18:50:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-19 18:50:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 18:50:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-19 18:50:31,156 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2019-11-19 18:50:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:31,157 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-19 18:50:31,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 18:50:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-19 18:50:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 18:50:31,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:31,158 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] [2019-11-19 18:50:31,159 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash -395195180, now seen corresponding path program 1 times [2019-11-19 18:50:31,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:31,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886486254] [2019-11-19 18:50:31,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:50:31,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886486254] [2019-11-19 18:50:31,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044419859] [2019-11-19 18:50:31,289 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-19 18:50:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:31,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 18:50:31,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:50:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:50:31,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 18:50:31,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2019-11-19 18:50:31,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522941996] [2019-11-19 18:50:31,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 18:50:31,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 18:50:31,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:50:31,437 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-11-19 18:50:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:31,593 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-11-19 18:50:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:50:31,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-19 18:50:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:31,595 INFO L225 Difference]: With dead ends: 84 [2019-11-19 18:50:31,596 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 18:50:31,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:50:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 18:50:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-11-19 18:50:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-19 18:50:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-11-19 18:50:31,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2019-11-19 18:50:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:31,606 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-11-19 18:50:31,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 18:50:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-11-19 18:50:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 18:50:31,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:31,608 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] [2019-11-19 18:50:31,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:50:31,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:31,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:31,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1510946244, now seen corresponding path program 1 times [2019-11-19 18:50:31,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:31,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336050477] [2019-11-19 18:50:31,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:31,971 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-19 18:50:31,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336050477] [2019-11-19 18:50:31,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:50:31,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 18:50:31,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494876969] [2019-11-19 18:50:31,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 18:50:31,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:31,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 18:50:31,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:50:31,974 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2019-11-19 18:50:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:32,156 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-19 18:50:32,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:50:32,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-19 18:50:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:32,158 INFO L225 Difference]: With dead ends: 70 [2019-11-19 18:50:32,158 INFO L226 Difference]: Without dead ends: 65 [2019-11-19 18:50:32,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-19 18:50:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-19 18:50:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-11-19 18:50:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 18:50:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-19 18:50:32,169 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2019-11-19 18:50:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:32,170 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-19 18:50:32,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 18:50:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-19 18:50:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 18:50:32,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:32,171 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] [2019-11-19 18:50:32,172 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash -353652332, now seen corresponding path program 1 times [2019-11-19 18:50:32,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:32,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576746448] [2019-11-19 18:50:32,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:50:32,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576746448] [2019-11-19 18:50:32,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619152146] [2019-11-19 18:50:32,260 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-19 18:50:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:32,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 18:50:32,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:50:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 18:50:32,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:50:32,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 18:50:32,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146121812] [2019-11-19 18:50:32,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 18:50:32,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:32,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 18:50:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:50:32,401 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-11-19 18:50:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:32,625 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2019-11-19 18:50:32,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 18:50:32,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-19 18:50:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:32,627 INFO L225 Difference]: With dead ends: 102 [2019-11-19 18:50:32,627 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 18:50:32,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-11-19 18:50:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 18:50:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-11-19 18:50:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-19 18:50:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-11-19 18:50:32,645 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-11-19 18:50:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:32,645 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-19 18:50:32,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 18:50:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-11-19 18:50:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 18:50:32,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:32,650 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-19 18:50:32,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:50:32,855 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1806454861, now seen corresponding path program 2 times [2019-11-19 18:50:32,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:32,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298615887] [2019-11-19 18:50:32,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:50:33,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298615887] [2019-11-19 18:50:33,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656313891] [2019-11-19 18:50:33,061 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 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-19 18:50:33,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:50:33,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:50:33,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-19 18:50:33,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:50:33,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 18:50:33,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:33,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:33,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:50:33,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-19 18:50:33,223 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 24 treesize of output 16 [2019-11-19 18:50:33,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:33,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:33,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 18:50:33,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-11-19 18:50:33,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:33,286 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-11-19 18:50:33,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:33,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:33,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:50:33,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2019-11-19 18:50:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:50:33,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:50:33,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-19 18:50:33,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266877986] [2019-11-19 18:50:33,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 18:50:33,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:33,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 18:50:33,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:50:33,298 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2019-11-19 18:50:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:33,701 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-19 18:50:33,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:50:33,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-11-19 18:50:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:33,703 INFO L225 Difference]: With dead ends: 75 [2019-11-19 18:50:33,703 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 18:50:33,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-19 18:50:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 18:50:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-19 18:50:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 18:50:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-19 18:50:33,713 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-11-19 18:50:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:33,714 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-19 18:50:33,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 18:50:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-19 18:50:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 18:50:33,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:33,715 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:50:33,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:50:33,920 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:33,921 INFO L82 PathProgramCache]: Analyzing trace with hash 217180203, now seen corresponding path program 3 times [2019-11-19 18:50:33,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:33,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45617858] [2019-11-19 18:50:33,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 18:50:34,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45617858] [2019-11-19 18:50:34,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2762101] [2019-11-19 18:50:34,232 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 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-19 18:50:34,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-19 18:50:34,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:50:34,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-19 18:50:34,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:50:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 18:50:34,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:50:34,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-11-19 18:50:34,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264243752] [2019-11-19 18:50:34,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 18:50:34,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 18:50:34,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-19 18:50:34,441 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-11-19 18:50:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:34,965 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2019-11-19 18:50:34,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 18:50:34,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-19 18:50:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:34,967 INFO L225 Difference]: With dead ends: 213 [2019-11-19 18:50:34,967 INFO L226 Difference]: Without dead ends: 205 [2019-11-19 18:50:34,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-11-19 18:50:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-19 18:50:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-11-19 18:50:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-19 18:50:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-11-19 18:50:34,987 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2019-11-19 18:50:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:34,987 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-11-19 18:50:34,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 18:50:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-11-19 18:50:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 18:50:34,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:34,989 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, 1, 1] [2019-11-19 18:50:35,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:50:35,193 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:35,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1805693939, now seen corresponding path program 4 times [2019-11-19 18:50:35,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:35,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217570950] [2019-11-19 18:50:35,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:50:35,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217570950] [2019-11-19 18:50:35,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111406399] [2019-11-19 18:50:35,400 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-19 18:50:35,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 18:50:35,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:50:35,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-19 18:50:35,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:50:35,485 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-19 18:50:35,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:35,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-19 18:50:35,537 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-19 18:50:35,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:35,550 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-19 18:50:35,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:35,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-19 18:50:35,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:35,598 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 11 treesize of output 15 [2019-11-19 18:50:35,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:35,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-19 18:50:35,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-19 18:50:35,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:35,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-19 18:50:35,666 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:35,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:50:35,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-11-19 18:50:36,017 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 18:50:36,019 INFO L343 Elim1Store]: treesize reduction 8, result has 92.9 percent of original size [2019-11-19 18:50:36,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 163 [2019-11-19 18:50:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:36,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,657 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 18:50:36,716 INFO L567 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2019-11-19 18:50:36,752 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:50:36,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 104 [2019-11-19 18:50:36,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:50:36,786 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-19 18:50:36,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 18:50:36,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 18:50:36,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:7 [2019-11-19 18:50:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:50:36,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:50:36,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-19 18:50:36,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175029595] [2019-11-19 18:50:36,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 18:50:36,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:36,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 18:50:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-19 18:50:36,801 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2019-11-19 18:50:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:37,411 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-11-19 18:50:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 18:50:37,412 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-19 18:50:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:37,413 INFO L225 Difference]: With dead ends: 168 [2019-11-19 18:50:37,413 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 18:50:37,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-11-19 18:50:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 18:50:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2019-11-19 18:50:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-19 18:50:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2019-11-19 18:50:37,431 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2019-11-19 18:50:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:37,432 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2019-11-19 18:50:37,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 18:50:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2019-11-19 18:50:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 18:50:37,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:37,434 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:50:37,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:50:37,637 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1169066102, now seen corresponding path program 1 times [2019-11-19 18:50:37,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:37,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248925679] [2019-11-19 18:50:37,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:50:37,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248925679] [2019-11-19 18:50:37,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930528801] [2019-11-19 18:50:37,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-19 18:50:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:37,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 18:50:37,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:50:37,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:50:37,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:50:37,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-19 18:50:37,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158693265] [2019-11-19 18:50:37,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 18:50:37,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 18:50:37,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:50:37,820 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2019-11-19 18:50:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:38,160 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-11-19 18:50:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 18:50:38,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-19 18:50:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:38,164 INFO L225 Difference]: With dead ends: 375 [2019-11-19 18:50:38,164 INFO L226 Difference]: Without dead ends: 289 [2019-11-19 18:50:38,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-11-19 18:50:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-19 18:50:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2019-11-19 18:50:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 18:50:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2019-11-19 18:50:38,186 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2019-11-19 18:50:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:38,186 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2019-11-19 18:50:38,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 18:50:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2019-11-19 18:50:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 18:50:38,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:38,188 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, 1, 1] [2019-11-19 18:50:38,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:50:38,391 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:38,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1846037516, now seen corresponding path program 1 times [2019-11-19 18:50:38,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:38,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954479614] [2019-11-19 18:50:38,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:50:38,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954479614] [2019-11-19 18:50:38,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355286276] [2019-11-19 18:50:38,475 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-19 18:50:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:50:38,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 18:50:38,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:50:38,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:50:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 18:50:38,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 18:50:38,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-11-19 18:50:38,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175852276] [2019-11-19 18:50:38,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 18:50:38,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:50:38,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 18:50:38,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-19 18:50:38,579 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 7 states. [2019-11-19 18:50:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:50:38,788 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-11-19 18:50:38,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:50:38,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-19 18:50:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:50:38,791 INFO L225 Difference]: With dead ends: 273 [2019-11-19 18:50:38,791 INFO L226 Difference]: Without dead ends: 241 [2019-11-19 18:50:38,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-19 18:50:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-19 18:50:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-11-19 18:50:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-19 18:50:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2019-11-19 18:50:38,825 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2019-11-19 18:50:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:50:38,825 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2019-11-19 18:50:38,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 18:50:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2019-11-19 18:50:38,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 18:50:38,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:50:38,830 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, 1, 1] [2019-11-19 18:50:39,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:50:39,034 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:50:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:50:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902770, now seen corresponding path program 1 times [2019-11-19 18:50:39,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:50:39,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126563658] [2019-11-19 18:50:39,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:50:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:50:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:50:39,143 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:50:39,143 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:50:39,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:50:39 BoogieIcfgContainer [2019-11-19 18:50:39,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:50:39,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:50:39,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:50:39,199 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:50:39,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:30" (3/4) ... [2019-11-19 18:50:39,203 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:50:39,267 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:50:39,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:50:39,269 INFO L168 Benchmark]: Toolchain (without parser) took 9970.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 960.4 MB in the beginning and 878.5 MB in the end (delta: 81.9 MB). Peak memory consumption was 421.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:50:39,269 INFO L168 Benchmark]: CDTParser took 0.27 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-19 18:50:39,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-19 18:50:39,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:50:39,271 INFO L168 Benchmark]: Boogie Preprocessor took 34.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:50:39,272 INFO L168 Benchmark]: RCFGBuilder took 530.70 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-11-19 18:50:39,272 INFO L168 Benchmark]: TraceAbstraction took 8657.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 887.8 MB in the end (delta: 199.1 MB). Peak memory consumption was 390.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:50:39,273 INFO L168 Benchmark]: Witness Printer took 68.18 ms. Allocated memory is still 1.4 GB. Free memory was 887.8 MB in the beginning and 878.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-11-19 18:50:39,277 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.27 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 606.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 530.70 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8657.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 887.8 MB in the end (delta: 199.1 MB). Peak memory consumption was 390.0 MB. Max. memory is 11.5 GB. * Witness Printer took 68.18 ms. Allocated memory is still 1.4 GB. Free memory was 887.8 MB in the beginning and 878.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); [L564] SLL head = ((void *)0); [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND FALSE !(len-- > 0) [L573] return head; [L617] SLL s = sll_create(len); [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) [L576] int len = 0; [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) [L581] return len; [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.5s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 504 SDtfs, 1527 SDslu, 2484 SDs, 0 SdLazy, 1177 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 441 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 588 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 533 ConstructedInterpolants, 3 QuantifiedInterpolants, 123727 SizeOfPredicates, 77 NumberOfNonLiveVariables, 1115 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 87/138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...